X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (2295) 2295
Conference Proceeding (618) 618
Publication (138) 138
Book Chapter (125) 125
Dissertation (80) 80
Magazine Article (14) 14
Paper (9) 9
Book / eBook (4) 4
Government Document (2) 2
Book Review (1) 1
Data Set (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
dominating set (756) 756
algorithms (631) 631
connected dominating set (550) 550
mathematics (544) 544
mathematics, applied (461) 461
graphs (395) 395
computer science (387) 387
wireless sensor networks (291) 291
computer science, theory & methods (282) 282
computer science, information systems (258) 258
approximation algorithms (222) 222
networks (222) 222
dominating sets (217) 217
telecommunications (207) 207
ad hoc networks (204) 204
graph theory (199) 199
wireless networks (197) 197
analysis (191) 191
mathematical analysis (177) 177
routing (172) 172
approximation (168) 168
engineering, electrical & electronic (165) 165
optimization (150) 150
construction (124) 124
sensors (120) 120
virtual backbone (115) 115
connected dominating sets (114) 114
combinatorics (107) 107
algorithm design and analysis (104) 104
distributed algorithms (103) 103
complexity (100) 100
theory of computation (97) 97
computer science, hardware & architecture (96) 96
minimum dominating set (95) 95
algorithm (92) 92
studies (92) 92
network topology (91) 91
approximation algorithm (90) 90
broadcasting (90) 90
operations research & management science (90) 90
computer science, interdisciplinary applications (89) 89
topology (89) 89
mobile ad hoc networks (88) 88
wireless sensor network (88) 88
theoretical computer science (87) 87
discrete mathematics and combinatorics (86) 86
computer science, software engineering (84) 84
05c69 (83) 83
clustering (82) 82
mathematical models (77) 77
computer simulation (76) 76
minimum connected dominating set (76) 76
computer networks (75) 75
domination (75) 75
domination number (73) 73
trees (72) 72
backbone (71) 71
graph (70) 70
independent set (70) 70
applied mathematics (66) 66
distributed algorithm (66) 66
computer communication networks (65) 65
energy consumption (63) 63
sets (62) 62
maximal independent set (60) 60
connectivity (59) 59
algorithm analysis and problem complexity (58) 58
engineering (56) 56
usage (56) 56
wireless communication (56) 56
energy efficiency (55) 55
remote sensors (55) 55
convex and discrete geometry (54) 54
operations research/decision theory (54) 54
tree (54) 54
protocols (52) 52
research (52) 52
topology control (52) 52
clustering algorithms (51) 51
mathematical modeling and industrial mathematics (51) 51
total dominating set (51) 51
unit disk graph (51) 51
computer science, artificial intelligence (50) 50
number (50) 50
spine (50) 50
planar graphs (49) 49
computation (48) 48
mathematics, general (48) 48
vertex cover (48) 48
discrete mathematics (46) 46
simulation (46) 46
edge dominating set (45) 45
broadcast (43) 43
sensor networks (43) 43
statistics & probability (43) 43
fault tolerance (41) 41
computational complexity (40) 40
mathematics of computing (40) 40
mobile computing (40) 40
data structures, cryptology and information theory (39) 39
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (2950) 2950
Chinese (37) 37
Japanese (21) 21
French (3) 3
Arabic (2) 2
Korean (2) 2
Portuguese (2) 2
Spanish (2) 2
German (1) 1
Polish (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
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
Journal Article
Journal Article
Information Sciences, ISSN 0020-0255, 02/2018, Volume 426, pp. 101 - 116
Journal Article
Annals of Operations Research, ISSN 0254-5330, 07/2017, Volume 254, Issue 1-2, pp. 37 - 46
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
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
Journal Article
Methods, ISSN 1046-2023, 06/2016, Volume 102, pp. 57 - 63
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
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
Journal Article
Networks, ISSN 0028-3045, 09/2016, Volume 68, Issue 2, pp. 104 - 120
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
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 01/2015, Volume 562, Issue C, pp. 1 - 22
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
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
Journal Article