Abstract
A subset of nodes S in a graph G is called k-dominating if, for every node u of the graph, the distance from u to S is at most k. We consider the parameter γk(G) defined as the cardinality of the smallest k-dominating set of G. For planar graphs, we show that for every ε > 0 and for every k ≽ (5/7 + ε)D, γk(G) = O(1/ε). For several subclasses of planar graphs of diameter D, we show that γk(G) is bounded by a constant for k ≽ D/2. We conjecture that the same result holds for every planar graph. This problem is motivated by the design of routing schemes with compact data structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hans Leo Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1–45, 1998.
Victor Chepoi and Yann Vaxes. On covering bridged plane triangulations with balls. Manuscript submitted, 2000.
Reinhard Diestel. Graph Theory (second edition), volume 173 of Graduate Texts in Mathematics. Springer, February 2000.
David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27:275–291, 2000.
Cyril Gavoille. On the dilation of interval routing. The Computer Journal, 43(1):1–7, 2000.
Cyril Gavoille. A survey on interval routing. Theoretical Computer Science, 245(2):217–253, 2000.
Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, and David Peleg. Approximate distance labeling schemes. In 9th Annual European Symposium on Algorithms (ESA), volume Lectures Notes in Computer Science. Springer, August 2001. To appear.
Cyril Gavoille and David Peleg. The compactness of interval routing. SIAM Journal on Discrete Mathematics, 12(4):459–473, October 1999.
Cyril Gavoille, David Peleg, André Raspaud, and Eric Sopena. Small k-dominating sets in planar graphs with applications. Research Report RR-1258-01, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, May 2001.
Rastislav Kráľovič, Peter Ružička, and Daniel Štefankovič. The complexity of shortest path and dilation bounded interval routing. Theoretical Computer Science, 234(1–2):85–107, 2000.
Laszlo Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383–390, 1975.
G. MacGillivray and K. Seyffarth. Domination numbers of planar graphs. Journal of Graph Theory, 22(3):213–229, 1996.
Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309–322, 1986.
Nicola Santoro and Ramez Khatib. Labelling and implicit routing in networks. The Computer Journal, 28(1):5–8, February 1985.
Savio S. H. Tse and Francis C. M. Lau. An optimal lower bound for interval routing in general networks. In 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 112–124. Carleton Scientific, July 1997.
Savio S. H. Tse and Francis C. M. Lau. Some results on the space requirement of interval routing. In 6th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 264–279. Carleton Scientific, July 1999.
Jan van Leeuwen and Richard B. Tan. Interval routing. The Computer Journal, 30(4):298–307, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavoille, C., Peleg, D., Raspaud, A., Sopena, E. (2001). Small k-Dominating Sets in Planar Graphs with Applications. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-45477-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42707-0
Online ISBN: 978-3-540-45477-9
eBook Packages: Springer Book Archive