X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (803) 803
Conference Proceeding (308) 308
Publication (38) 38
Dissertation (31) 31
Book Chapter (23) 23
Magazine Article (12) 12
Book / eBook (3) 3
Paper (2) 2
Data Set (1) 1
Government Document (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
connected dominating set (550) 550
algorithms (287) 287
wireless sensor networks (226) 226
computer science (158) 158
wireless networks (156) 156
telecommunications (150) 150
ad hoc networks (149) 149
networks (126) 126
computer science, information systems (124) 124
routing (124) 124
mathematics (120) 120
engineering, electrical & electronic (119) 119
connected dominating sets (114) 114
approximation algorithms (112) 112
graphs (111) 111
computer science, theory & methods (107) 107
mathematics, applied (105) 105
virtual backbone (98) 98
analysis (96) 96
construction (93) 93
sensors (88) 88
approximation (84) 84
minimum connected dominating set (76) 76
wireless sensor network (72) 72
dominating set (70) 70
algorithm design and analysis (67) 67
mobile ad hoc networks (67) 67
optimization (66) 66
broadcasting (63) 63
network topology (62) 62
topology (62) 62
graph theory (59) 59
approximation algorithm (58) 58
backbone (58) 58
mathematical analysis (56) 56
computer science, hardware & architecture (55) 55
studies (55) 55
remote sensors (54) 54
algorithm (53) 53
computer networks (53) 53
energy consumption (51) 51
distributed algorithm (50) 50
distributed algorithms (50) 50
computer simulation (49) 49
clustering (47) 47
energy efficiency (47) 47
connected domination (46) 46
combinatorics (44) 44
topology control (44) 44
maximal independent set (42) 42
computer science, interdisciplinary applications (41) 41
connectivity (41) 41
spine (41) 41
engineering (40) 40
wireless communication (40) 40
computer communication networks (39) 39
unit disk graph (38) 38
theory of computation (37) 37
cds (34) 34
communications engineering, networks (34) 34
mathematical models (32) 32
trees (32) 32
mobile computing (31) 31
research (31) 31
operations research & management science (30) 30
ad hoc network (29) 29
clustering algorithms (29) 29
fault tolerance (29) 29
protocols (29) 29
routing protocols (29) 29
computer science, software engineering (27) 27
convex and discrete geometry (27) 27
simulation (27) 27
usage (27) 27
wireless ad hoc networks (27) 27
05c69 (26) 26
domination (26) 26
mathematical modeling and industrial mathematics (26) 26
sensor networks (26) 26
unit disk graphs (26) 26
approximation methods (25) 25
theoretical computer science (25) 25
tree (25) 25
protocol (24) 24
broadcast (23) 23
ad hoc (21) 21
complexity (21) 21
dominating sets (21) 21
messages (21) 21
connected domination number (20) 20
delay (20) 20
electrical engineering (20) 20
energy use (20) 20
operations research/decision theory (20) 20
simuliertes ergebnis (20) 20
learning automata (19) 19
relays (19) 19
ad-hoc-netz (18) 18
discrete mathematics and combinatorics (18) 18
heuristic algorithms (18) 18
more...
Language Language
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
IEEE/ACM Transactions on Networking, ISSN 1063-6692, 06/2017, Volume 25, Issue 3, pp. 1803 - 1817
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 3, pp. 198 - 208
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
Theoretical Computer Science, ISSN 0304-3975, 11/2015, Volume 607, pp. 480 - 487
The proper connection number pc(G) of a connected graph G is defined as the minimum number of colors needed to color its edges, so that every pair of distinct... 
proper connection number | diameter | connected dominating set | proper-path coloring | Proper-path coloring | COMPUTER SCIENCE, THEORY & METHODS | Connected dominating set | Proper connection number | Diameter | GRAPHS | Intervals | Thresholds | Upper bounds | Circularity | Chains | Graphs | Graph theory
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2014, Volume 236, Issue 2, pp. 410 - 418
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 10/2012, Volume 71, Issue 2, pp. 206 - 218
The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected... 
connected two‐step dominating set | minimum degree | rainbow connectivity | rainbow coloring | radius | connected dominating set | connected two-step dominating set | MATHEMATICS | GRAPHS | Algorithms
Journal Article
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2019
Journal Article
Sensors (Switzerland), ISSN 1424-8220, 04/2019, Volume 19, Issue 8, p. 1919
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2014, Volume 28, Issue 4, pp. 1916 - 1929
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 12/2015, Volume 608, pp. 120 - 134
Recently developed wake-up receivers pose a viable alternative for duty-cycling in wireless sensor networks. Here, a special radio signal can wake up close-by... 
Unit-disk graph | Online algorithm | Wake-up receivers | Connected dominating set | Epidemic algorithms | COMPUTER SCIENCE, THEORY & METHODS | Wireless sensor networks | Algorithms | Sensors | Analysis | Epidemics | Development and progression | Radio signals | Computer simulation | Placement | Wakes | Graphs | Mathematical models | Online
Journal Article
IEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219, 02/2009, Volume 20, Issue 2, pp. 147 - 157
Journal Article
Information Sciences, ISSN 0020-0255, 06/2014, Volume 269, pp. 286 - 299
Swapped Networks (SNs) are a family of two-level interconnection networks, suitable for constructing large parallel and distributed systems. In this paper, the... 
[formula omitted]-hard | Approximation | Dominating set | Connected dominating set | Swapped network | NP-hard | PERFORMANCE | COMPUTER SCIENCE, INFORMATION SYSTEMS | MESH | OTIS NETWORKS | ALGORITHMS | AD-HOC NETWORKS | SETS | BROADCAST | WIRELESS NETWORKS | GLOBAL COMBINE | INTERCONNECTION NETWORKS | Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 05/2016, Volume 630, pp. 63 - 75
Enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a... 
Exact exponential algorithms | Minimal connected dominating sets | Enumeration | FEEDBACK VERTEX SETS | TRIANGULATIONS | COMPUTER SCIENCE, THEORY & METHODS | COMBINATORIAL BOUNDS | Algorithms | Graphs | Graph theory | Tasks | Upper bounds
Journal Article
Computer Networks, ISSN 1389-1286, 08/2017, Volume 123, pp. 137 - 152
In a Wireless Sensor Network (WSN), neither there is any fixed infrastructure nor any centralized control. Therefore, for efficient routing, some of the nodes... 
Maximal Independent Set (MIS) | Connected Dominating Set (CDS) | Unit Disk Graph (UDG) | Steiner Tree | Virtual Backbone | ROTATION | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | DOMATIC PARTITION | COMPUTER SCIENCE, INFORMATION SYSTEMS | ALGORITHMS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | CDS
Journal Article
Information Processing Letters, ISSN 0020-0190, 12/2018, Volume 140, pp. 30 - 33
A graph is k-connected if it has k pairwise internally node disjoint paths between every pair of its nodes. A subset S of nodes in a graph G is a k-connected... 
Approximation algorithm | m-Dominating set | k-Connected graph | COMPUTER SCIENCE, INFORMATION SYSTEMS | GRAPHS | Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2006, Volume 352, Issue 1, pp. 1 - 7
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the... 
Connected dominating set | Independent set | Unit disk graphs | unit disk graphs | COMPUTER SCIENCE, THEORY & METHODS | APPROXIMATION | connected dominating set | independent set | Computer science | Algorithms
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.