1.
Full Text
Connected dominating sets in wireless ad hoc and sensor networks – A comprehensive survey

Computer Communications, ISSN 0140-3664, 01/2013, Volume 36, Issue 2, pp. 121 - 134

Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve...

Wireless network | Topology control | Virtual backbone network | Connected dominating set (CDS) | APPROXIMATION ALGORITHMS | CDS | BACKBONE CONSTRUCTION | COMPUTER SCIENCE, INFORMATION SYSTEMS | VIRTUAL BACKBONE | PARTITION | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC

Wireless network | Topology control | Virtual backbone network | Connected dominating set (CDS) | APPROXIMATION ALGORITHMS | CDS | BACKBONE CONSTRUCTION | COMPUTER SCIENCE, INFORMATION SYSTEMS | VIRTUAL BACKBONE | PARTITION | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 01/2016, Volume 198, pp. 136 - 146

A set S⊆V of the graph G=(V,E) is called a [1,2]-set of G if any vertex which is not in S has at least one but no more than two neighbors in S. A set S′⊆V is...

Trees | Dominating sets | [formula omitted]-sets | Total dominating sets | [1,2]-sets | MATHEMATICS, APPLIED | DOMINATION PROBLEM | GRAPHS | Algorithms | Mathematics

Trees | Dominating sets | [formula omitted]-sets | Total dominating sets | [1,2]-sets | MATHEMATICS, APPLIED | DOMINATION PROBLEM | GRAPHS | Algorithms | Mathematics

Journal Article

Algorithmica, ISSN 0178-4617, 5/2019, Volume 81, Issue 5, pp. 1938 - 1964

This paper is devoted to the online dominating set problem and its variants. We believe the paper represents the first systematic study of the effect of two...

Online algorithms | Computer Systems Organization and Communication Networks | Algorithms | Dominating set | Mathematics of Computing | Competitive analysis | Irrevocability | Computer Science | Theory of Computation | Algorithm Analysis and Problem Complexity | Data Structures and Information Theory | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | Computer science | Analysis

Online algorithms | Computer Systems Organization and Communication Networks | Algorithms | Dominating set | Mathematics of Computing | Competitive analysis | Irrevocability | Computer Science | Theory of Computation | Algorithm Analysis and Problem Complexity | Data Structures and Information Theory | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | Computer science | Analysis

Journal Article

Information Sciences, ISSN 0020-0255, 02/2018, Volume 426, pp. 101 - 116

Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised...

Order-based representation | Randomised local search | Minimum dominating set | Heuristics | Complex networks | COMMUNITY STRUCTURE | APPROXIMATION | COMPUTER SCIENCE, INFORMATION SYSTEMS | NETWORKS | GENETIC ALGORITHM | Social networks | Algorithms | Computer science | Mineral industry | Management science | Mining industry | Computer Science - Social and Information Networks

Order-based representation | Randomised local search | Minimum dominating set | Heuristics | Complex networks | COMMUNITY STRUCTURE | APPROXIMATION | COMPUTER SCIENCE, INFORMATION SYSTEMS | NETWORKS | GENETIC ALGORITHM | Social networks | Algorithms | Computer science | Mineral industry | Management science | Mining industry | Computer Science - Social and Information Networks

Journal Article

Annals of Operations Research, ISSN 0254-5330, 07/2017, Volume 254, Issue 1-2, pp. 37 - 46

1.5 dimensional (1.5D) terrain is characterized by a piecewise linear curve. Locating minimum number of guards on the terrain (T) to cover/guard the whole...

Finite dominating sets | Terrain guarding problem | Zero-one integer programming | Location | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | APPROXIMATION ALGORITHMS | NETWORK LOCATION-PROBLEMS | POLYHEDRAL TERRAINS | Approximation theory | Convex functions | Algorithms | Research | Mathematical research | Integer programming | Studies | Satellites | Operations research | Approximation | Mathematical analysis | Terrain | Location analysis | Guards | Estimating techniques

Finite dominating sets | Terrain guarding problem | Zero-one integer programming | Location | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | APPROXIMATION ALGORITHMS | NETWORK LOCATION-PROBLEMS | POLYHEDRAL TERRAINS | Approximation theory | Convex functions | Algorithms | Research | Mathematical research | Integer programming | Studies | Satellites | Operations research | Approximation | Mathematical analysis | Terrain | Location analysis | Guards | Estimating techniques

Journal Article

IEEE/ACM Transactions on Networking, ISSN 1063-6692, 10/2016, Volume 24, Issue 5, pp. 2690 - 2701

Over years, virtual backbone has attracted lots of attention as a promising approach to deal with the broadcasting storm problem in wireless networks....

Algorithm design and analysis | virtual backbone | Particle separators | Wireless networks | approximation algorithm | Approximation algorithms | Graph theory | Approximation methods | 3-connected m -dominating set | fault-tolerant | Tutte decomposition | IEEE transactions | 3-connected m-dominating set | Approximation algorithm | Fault-tolerant | Virtual backbone | 3-connected $m$-dominating set | wireless networks | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | WIRELESS | CONSTRUCTION | COMPUTER SCIENCE, THEORY & METHODS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC

Algorithm design and analysis | virtual backbone | Particle separators | Wireless networks | approximation algorithm | Approximation algorithms | Graph theory | Approximation methods | 3-connected m -dominating set | fault-tolerant | Tutte decomposition | IEEE transactions | 3-connected m-dominating set | Approximation algorithm | Fault-tolerant | Virtual backbone | 3-connected $m$-dominating set | wireless networks | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | WIRELESS | CONSTRUCTION | COMPUTER SCIENCE, THEORY & METHODS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC

Journal Article

SENSORS, ISSN 1424-8220, 05/2019, Volume 19, Issue 9, p. 2191

Vehicular Ad-hoc Networks (VANETs): As an active research area in the field of wireless sensor networks, they ensure road safety by exchanging alert messages...

CHEMISTRY, ANALYTICAL | AD HOC NETWORKS | ALGORITHM | PROTOCOL | intelligent transportation systems | vehicular ad-hoc network | CHALLENGES | ENGINEERING, ELECTRICAL & ELECTRONIC | message dissemination | INSTRUMENTS & INSTRUMENTATION | connected dominating set | DISSEMINATION | cluster-based information dissemination protocol | set cover problem | Remote sensors | Messages | Roads & highways | Computer simulation | Ad hoc networks | Topology | Clustering | Vehicles | Highways | Wireless sensor networks | Algorithms | Traffic safety | Internet | Protocol | Traffic congestion | Communication

CHEMISTRY, ANALYTICAL | AD HOC NETWORKS | ALGORITHM | PROTOCOL | intelligent transportation systems | vehicular ad-hoc network | CHALLENGES | ENGINEERING, ELECTRICAL & ELECTRONIC | message dissemination | INSTRUMENTS & INSTRUMENTATION | connected dominating set | DISSEMINATION | cluster-based information dissemination protocol | set cover problem | Remote sensors | Messages | Roads & highways | Computer simulation | Ad hoc networks | Topology | Clustering | Vehicles | Highways | Wireless sensor networks | Algorithms | Traffic safety | Internet | Protocol | Traffic congestion | Communication

Journal Article

Computer Networks, ISSN 1389-1286, 03/2019, Volume 151, pp. 124 - 131

Owing to its dynamic topology with the lack of its central administration, the provisioning of quality of service (QoS) in case of the mobile ad hoc networks...

Mobile ad hoc networks (MANETs) | Ad-hoc on-demand multipath distance vector routing (AOMDV) | Quality of service (QoS) | Connected dominating set (CDS) | Load balancing | Stochastic diffusion search (SDS) | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | SCHEME | ROUTING PROTOCOL | OPTIMIZATION ALGORITHM | MOBILE | Engineering schools | Algorithms | Residual energy | Mobile communication systems | Wireless networks | Quality of service | Quality of service architectures | Ad hoc networks | Topology | Protocol (computers) | Provisioning | Nodes

Mobile ad hoc networks (MANETs) | Ad-hoc on-demand multipath distance vector routing (AOMDV) | Quality of service (QoS) | Connected dominating set (CDS) | Load balancing | Stochastic diffusion search (SDS) | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | SCHEME | ROUTING PROTOCOL | OPTIMIZATION ALGORITHM | MOBILE | Engineering schools | Algorithms | Residual energy | Mobile communication systems | Wireless networks | Quality of service | Quality of service architectures | Ad hoc networks | Topology | Protocol (computers) | Provisioning | Nodes

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 12/2019, Volume 799, pp. 115 - 123

A locating-dominating set of a graph G is a dominating set of G such that every vertex of G outside the dominating set is uniquely identified by its...

Location-domination number | Functigraph | Locating-dominating set | GRAPH | COMPUTER SCIENCE, THEORY & METHODS | CODES

Location-domination number | Functigraph | Locating-dominating set | GRAPH | COMPUTER SCIENCE, THEORY & METHODS | CODES

Journal Article

Ad Hoc Networks, ISSN 1570-8705, 05/2016, Volume 42, pp. 61 - 73

In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers...

Wireless sensor networks | Connected Dominating Set (CDS) | Maximal independent set (MIS) | Steiner Tree | Unit disk graph (UDG) | ROTATION | CDS | ALGORITHM | DOMATIC PARTITION | COMPUTER SCIENCE, INFORMATION SYSTEMS | TREE | TELECOMMUNICATIONS | Computer science | Algorithms | Sensors | Networks | Construction | Messages | Approximation | Wireless networks | Complexity | Construction costs

Wireless sensor networks | Connected Dominating Set (CDS) | Maximal independent set (MIS) | Steiner Tree | Unit disk graph (UDG) | ROTATION | CDS | ALGORITHM | DOMATIC PARTITION | COMPUTER SCIENCE, INFORMATION SYSTEMS | TREE | TELECOMMUNICATIONS | Computer science | Algorithms | Sensors | Networks | Construction | Messages | Approximation | Wireless networks | Complexity | Construction costs

Journal Article

Methods, ISSN 1046-2023, 06/2016, Volume 102, pp. 57 - 63

•The fast increase of ‘multi-omics’ data requires novel algorithmic methodologies.•The minimum dominating set (MDS) approach is a promising method to analyse...

Network controllability | Protein-protein interaction networks | Minimum dominating set | Complex networks | NODES | BIOCHEMISTRY & MOLECULAR BIOLOGY | BIOCHEMICAL RESEARCH METHODS | ALGORITHMS | DISCOVERY | DYNAMICS | SYSTEMS | CONTROLLABILITY | PARADIGM | Metabolomics | Phenotype | Algorithms | Datasets as Topic | Humans | Proteomics | Data Mining - methods | Protein Interaction Maps | Information science | Analysis | Methods | Protein-protein interactions

Network controllability | Protein-protein interaction networks | Minimum dominating set | Complex networks | NODES | BIOCHEMISTRY & MOLECULAR BIOLOGY | BIOCHEMICAL RESEARCH METHODS | ALGORITHMS | DISCOVERY | DYNAMICS | SYSTEMS | CONTROLLABILITY | PARADIGM | Metabolomics | Phenotype | Algorithms | Datasets as Topic | Humans | Proteomics | Data Mining - methods | Protein Interaction Maps | Information science | Analysis | Methods | Protein-protein interactions

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 10/2016, Volume 651, pp. 37 - 49

Suppose that we are given two dominating sets Ds and Dt of a graph G whose cardinalities are at most a given threshold k. Then, we are asked whether there...

Dominating set | Combinatorial reconfiguration | Graph algorithm | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHM | Computer science | Business schools | Algorithms | Intervals | Forests | Deletion | Graphs | Graph theory | Complexity | Reconfiguration

Dominating set | Combinatorial reconfiguration | Graph algorithm | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHM | Computer science | Business schools | Algorithms | Intervals | Forests | Deletion | Graphs | Graph theory | Complexity | Reconfiguration

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 02/2016, Volume 200, pp. 52 - 58

A locating–dominating set of a graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct...

Dominating sets | Locating–dominating sets | Locating-dominating sets | MATHEMATICS, APPLIED | Trees | Graphs | Construction | Graph theory | Mathematical analysis | Mathematics - Combinatorics

Dominating sets | Locating–dominating sets | Locating-dominating sets | MATHEMATICS, APPLIED | Trees | Graphs | Construction | Graph theory | Mathematical analysis | Mathematics - Combinatorics

Journal Article

Networks, ISSN 0028-3045, 09/2016, Volume 68, Issue 2, pp. 104 - 120

The automated real time control of an electrical network is achieved through the estimation of its state using phasor measurement units. Given an undirected...

real time electrical network monitoring | power dominating set | PMU placement problem | bilevel program | mixed‐integer linear program | observability | mixed-integer linear program | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PLACEMENT | DOMINATION | GRAPHS | Electric power generation | Networks | Phasors | Electric networks | Solvers | Graphs | Mathematical models | Graph theory

real time electrical network monitoring | power dominating set | PMU placement problem | bilevel program | mixed‐integer linear program | observability | mixed-integer linear program | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PLACEMENT | DOMINATION | GRAPHS | Electric power generation | Networks | Phasors | Electric networks | Solvers | Graphs | Mathematical models | Graph theory

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 08/2019, Volume 780, pp. 54 - 65

A dominating set is a set S of vertices in a graph such that every vertex not in S is adjacent to a vertex in S. In this paper, we consider the set of all...

NP-hardness | Interval graphs | Permutation graphs | Dominating set | Total dominating set | COMPUTER SCIENCE, THEORY & METHODS | VERTEX PARTITIONING PROBLEMS | Hardness | Computer Science

NP-hardness | Interval graphs | Permutation graphs | Dominating set | Total dominating set | COMPUTER SCIENCE, THEORY & METHODS | VERTEX PARTITIONING PROBLEMS | Hardness | Computer Science

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 01/2015, Volume 562, Issue C, pp. 1 - 22

An independent dominating set of a graph G is a subset D of V such that every vertex not in D is adjacent to at least one vertex of D and no two vertices in D...

Independent dominating set | At-most-cubic grid graph | Dominating set | Cubic bipartite graph | FPT-algorithm | [formula omitted]-graph | Weighted independent dominating set | NP-complete | (k, ℓ)-graph | At-most-cubic grid graph (k,l)-graph | APPROXIMATION | ALGORITHMS | SPLIT | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | HARDNESS | Computer science | Algorithms | Constants | Graphs | Polynomials | Graph theory | Proving

Independent dominating set | At-most-cubic grid graph | Dominating set | Cubic bipartite graph | FPT-algorithm | [formula omitted]-graph | Weighted independent dominating set | NP-complete | (k, ℓ)-graph | At-most-cubic grid graph (k,l)-graph | APPROXIMATION | ALGORITHMS | SPLIT | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | HARDNESS | Computer science | Algorithms | Constants | Graphs | Polynomials | Graph theory | Proving

Journal Article

European Journal of Operational Research, ISSN 0377-2217, 11/2015, Volume 247, Issue 1, pp. 16 - 26

•We introduce and study the minimum edge blocker dominating set problem.•We prove the NP-hardness of the problem.•We formulate the problem as a linear 0–1...

Minimum weighted dominating set | NP-hardness | Branch-and-cut algorithm | Critical elements detection | Network interdiction | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DETECTING CRITICAL NODES | INTERDICTION | ALGORITHMS | Analysis | Graph theory

Minimum weighted dominating set | NP-hardness | Branch-and-cut algorithm | Critical elements detection | Network interdiction | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DETECTING CRITICAL NODES | INTERDICTION | ALGORITHMS | Analysis | Graph theory

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2011, Volume 159, Issue 17, pp. 2147 - 2164

The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems like Dominating Set and Independent...

Measure and conquer | Branch and reduce | Exponential time algorithms | Dominating set | Computer aided algorithm design | Exact algorithms | MATHEMATICS, APPLIED | COMPLEXITY | TIME | Analysis | Algorithms | Mathematical analysis | Programming | Running | Series (mathematics) | Tools | Mathematical models | Combinatorial analysis

Measure and conquer | Branch and reduce | Exponential time algorithms | Dominating set | Computer aided algorithm design | Exact algorithms | MATHEMATICS, APPLIED | COMPLEXITY | TIME | Analysis | Algorithms | Mathematical analysis | Programming | Running | Series (mathematics) | Tools | Mathematical models | Combinatorial analysis

Journal Article