Abstract
A tree t-spanner of a graph G is a spanning subtree T of G in which the distance between every pair of vertices is at most t times their distance in G. Spanner problems have received some attention, mostly in the context of communication networks. It is known that for general unweighted graphs, the problem of deciding the existence of a tree t-spanner can be solved in polynomial time for t=2, while it is NP-hard for any t≥ 4; the case t=3 is open, but has been conjectured to be hard.
In this paper, we consider tree spanners in planar graphs. We show that even for planar unweighted graphs, it is NP-hard to determine the minimum t for which a tree t-spanner exists. On the other hand, we give a polynomial algorithm for any fixed t that decides for planar unweighted graphs with bounded face length whether there is a tree t-spanner. Furthermore, we prove that it can be decided in polynomial time whether a planar unweighted graph has a tree t-spanner for t=3.
This is a preview of subscription content, log in via an institution to check access.
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
Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete and Computational Geometry 9, 81–100 (1993)
Arikati, S., Chen, D.Z., Chew, L.P., Das, G., Smid, M., Zaroliagis, D.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: Diaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 514–528. Springer, Heidelberg (1996)
Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light-weight spanners. Manuscript (1992)
Bhatt, S., Chung, F., Leighton, F., Rosenberg, A.: Optimal simulations of tree machines. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS 1986), pp. 274–282 (1986)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, New York (1976)
Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335–379 (1976)
Brandes, U., Handke, D.: NP-completeness results for minimum planar spanners. In: Möhring, R.H. (ed.) WG 1997. LNCS, vol. 1335, pp. 85–99. Springer, Heidelberg (1997)
Cai, L.: Tree spanners: spanning trees that approximate distances. Ph. D. thesis, University of Toronto, Toronto, Canada, Available as Technical Report 260/92, Department of Computer Science, University of Toronto (1992)
Cai, L.: NP-completeness of minimum spanner problems. Discrete Applied Mathematics 48, 187–194 (1994)
Cai, L., Corneil, D.G.: Tree spanners. SIAM Journal of Discrete Mathematics 8, 359–387 (1995)
Chew, L.P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the 2nd ACM Symposium on Computational Geometry, pp. 169–177 (1986)
Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete and Computational Geometry 5, 399–407 (1990)
Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM 21, 549–568 (1974)
Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. In: Nurmi, O., Ukkonen, E. (eds.) SWAT 1992. LNCS, vol. 621. Springer, Heidelberg (1992)
Kremer, J.: Baumspanner in planaren Graphen. Diploma thesis, Mathematisches Institut, Universität zu Köln (1997)
Lichtenstein, D.: Planar formulae and their uses. SIAM Journal of Computing 11, 329–343 (1982)
Liestman, A.L., Shermer, T.: Grid spanners. Networks 23, 123–133 (1993)
Mansfield, A.: Determining the thickness of graphs is NP-hard. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 93, pp. 9–23 (1983)
Peleg, D., Schäffer, A.A.: Graph spanners. Journal of Graph Theory 13, 99–116 (1989)
Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 77–85 (1987)
Peleg, D., Upfal, E.: A tradeoff between space and efficiency for routing tables. In: Proceedings ofthe 20th ACM Symposium on the Theory of Computing (STOC 1988), pp. 43–52 (1998)
Richards, D., Liestman, A.L.: Degree-constrained pyramid spanners. Parallel and Distributed Computing 25, 1–6 (1995)
Soares, J.: Graph spanners: a survey. Congressus Numerantium 89, 225–238 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fekete, S.P., Kremer, J. (1998). Tree Spanners in Planar Graphs. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_24
Download citation
DOI: https://doi.org/10.1007/10692760_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive