Skip to main content
SpringerLink
Log in

Isomorphic tree spanner problems

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

A treet-spanner, wheret is a positive integer, of a graph G is a spanning tree in which the distance between the two ends of every edge ofG is at mostt. This notion is motivated by applications in distributed systems and communication networks. This paper is concerned with the problem of determining whether a graph contains a tree t-spanner isomorphic to a given tree. It is shown that the problem fort=2 is solvable in O(n3.5) time for 2-connected graphs, whereas the problem for any fixed integert ≥ 3 is NP-complete, even for 2-connected bipartite graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Awerbuch, A. Baratz, and D. Peleg. Efficient broadcast and light-weight spanners. Manuscript, 1992.

  2. L. Cai. Tree 2-spanners. CMPT TR 91-4, School of Computing Science, Simon Fraser University, 1991.

  3. L. Cai. Tree Spanners: Spanning Trees that Approximate Distances. Ph.D. thesis, University of Toronto, Toronto, 1992. Technical Report 260/92, Department of Computer Science, University of Toronto, 1992.

  4. L. Cai and D. G. Corneil. Tree spanners.SIAM J. Discrete Math., 1995, to appear.

  5. M. R. Garey and D. S. Johnson.Computers and Intractability: A Guide to the Theory of NP-completeness Freeman, San Francisco, 1979.

    Google Scholar 

  6. J. E. Hopcroft and R. M. Karp. An n5/2 algorithm for maximum matchings in bipartite graphs.SIAM J. Comput., 2:225–231, 1973.

    Google Scholar 

  7. D. Matula. An algorithm for subtree identification.SIAM Rev., 10:273–274, 1968.

    Google Scholar 

  8. D. Matula. Subtree isomorphism in O(n5/2).Am. Discrete Math., 2:91–106, 1978.

    Google Scholar 

  9. C. H. Papadimitriou and M. Yannakakis. The complexity of restricted spanning tree problems.J. Assoc. Comput. Mach., 29(2):285–309, 1982.

    Google Scholar 

  10. D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube.Proc. 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 77–85.

  11. D. Peleg and E. Upfal. A tradeoff between space and efficiency for routing tables.Proc. 20th Ann. ACM Symposium on the Theory of Computing, 1988, pp. 43–52.

  12. S. W. Reyner. An analysis of a good algorithm for the subtree problem.SIAM J. Comput., 6(4):730–732, 1977.

    Google Scholar 

Download references

Author information

Author notes

  1. L. Cai

    Present address: Department of Computer Science, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Ontario, Canada

    L. Cai & D. Corneil

Authors
  1. L. Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Corneil
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by H. N. Gabow.

Financial support for this research was received from the Natural Sciences and Engineering Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cai, L., Corneil, D. Isomorphic tree spanner problems. Algorithmica 14, 138–153 (1995). https://doi.org/10.1007/BF01293665

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01293665

Key words

Search

Navigation