Minimum connected dominating sets in finite graphs
zbMATH Open1214.68179MaRDI QIDQ712285FDOQ712285
Publication date: 28 October 2010
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.math.ac.vn/publications/vjm/VJM_38/157.htm
Recommendations
- Approximation algorithms for connected dominating sets
- Approximation algorithms for connected dominating sets
- Greedy approximation for the minimum connected dominating set with labeling
- A greedy approximation for minimum connected dominating sets
- Minimum connected dominating sets of random cubic graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (10)
- Title not available (Why is that?)
- A unified greedy approximation for several dominating set problems
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Title not available (Why is that?)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
- Minimum connected dominating sets of random cubic graphs
- Minimum 2-dominating sets in regular graphs
- A greedy approximation for minimum connected dominating sets
- Title not available (Why is that?)
- The Minset-Poset Approach to Representations of Graph Connectivity
This page was built for publication: Minimum connected dominating sets in finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712285)
