|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 34 occurrences of 25 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu |
On minimum m -connected k -dominating set problem in unit disc graphs.  |
J. Comb. Optim.  |
2008 |
DBLP DOI BibTeX RDF |
k-dominating set, m-connectivity, Unit disc graph, Wireless sensor networks, Approximation algorithm |
| 2 | Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu |
Algorithms for Minimum m -Connected k -Dominating Set Problem.  |
COCOA  |
2007 |
DBLP DOI BibTeX RDF |
k-vertex connectivity, wireless sensor networks, approximation algorithm, Connected dominating set |
| 2 | Jennie C. Hansen, Eric Schmutz, Li Sheng |
The Expected Size of the Rule k Dominating Set.  |
Algorithmica  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Fei Dai, Jie Wu |
On Constructing k-Connected k-Dominating Set in Wireless Networks.  |
IPDPS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela R. Argiroffo, Maria E. Ugarte, Mariana S. Escalante |
On the k-dominating set polytope of web graphs.  |
Electronic Notes in Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore |
A Self-Stabilizing O(n)-Round k-Clustering Algorithm.  |
SRDS  |
2009 |
DBLP DOI BibTeX RDF |
K-dominating set, K-clustering, silent, self-stabilization, unfair scheduler |
| 1 | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai |
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks.  |
IEEE Trans. Mob. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
mobile ad hoc network, routing protocols, Network topology, Algorithm/Protocol Design and Analysis, localized communication |
| 1 | Petr A. Golovach, Yngve Villanger |
Parameterized Complexity for Domination Problems on Degenerate Graphs.  |
WG  |
2008 |
DBLP DOI BibTeX RDF |
degenerate graphs, algorithms, domination, Parameterized complexity |
| 1 | Yongxuan Lai, Hong Chen |
Energy-Efficient Fault-Tolerant Mechanism for Clustered Wireless Sensor Networks.  |
ICCCN  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Fei Dai, Jie Wu |
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks.  |
J. Parallel Distrib. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sriram V. Pemmaraju, Imran A. Pirwani |
Energy conservation via domatic partitions.  |
MobiHoc  |
2006 |
DBLP DOI BibTeX RDF |
domatic partition, growth-bounded graphs, distributed algorithms, metric space, dominating sets, unit disk graphs, maximal independent sets, network decomposition, doubling dimension, unit ball graphs |
| 1 | Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis |
Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.  |
OPODIS  |
2006 |
DBLP DOI BibTeX RDF |
fault-tolerance, approximation algorithms, distributed algorithms, dominating set, unit disk graph, maximal independent set |
| 1 | Rolando Menchaca-Mendez, Ravindra Vaishampayan, J. J. Garcia-Luna-Aceves, Katia Obraczka |
DPUMA: A Highly Efficient Multicast Routing Protocol for Mobile Ad Hoc Networks.  |
ADHOC-NOW  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.  |
Algorithmica  |
2005 |
DBLP DOI BibTeX RDF |
Subexponential algorithms, Dominating set, Graph minors |
| 1 | Jennie C. Hansen, Eric Schmutz |
The Expected Size of the Rule k Dominating Set  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dimitrios M. Thilikos |
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.  |
ICALP  |
2004 |
DBLP DOI BibTeX RDF |
embedded graphs, subexponential algorithms, Dominating set, parameterized algorithms, branch-width |
| 1 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.  |
ISAAC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | William Duckworth, Bernard Mans |
Small k-Dominating Sets of Regular Graphs.  |
RANDOM  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier |
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.  |
Algorithmica  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena |
Small k-Dominating Sets in Planar Graphs with Applications.  |
WG  |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|