Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1995: Computing and Combinatorics pp 121–130Cite as

Maximum tree-packing in time O(n5/2)

  • Session 3A: Graph Algorithms
  • Conference paper
  • First Online:

  • 146 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Abstract

The problem of determining the maximum number of node-disjoint subtrees of a tree T on n t nodes isomorphic to a tree S on n s nodes is shown to be solvable in time O(n 3/2s nt). The same asymptotic bounds are observed for the corresponding problems where topological imbedding and subgraph homeomorphism are respectively substituted for subgraph isomorphism.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.

    Google Scholar 

  2. F. Berman, D. Johnson, T. Leighton, P.W. Shor, and L. Snyder. Generalized planar matching. Journal of Algorithms, 11 (1990), pp. 153–184.

    Article  Google Scholar 

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

    Google Scholar 

  4. A. Gupta, N. Nishimura. Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. Proc. SWAT'94, LNCS 824, pp. 172–182.

    Google Scholar 

  5. F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1979.

    Google Scholar 

  6. P. Hell and D.G. Kirkpatrick. On generalized matching problems. Information Processing Letters 12 (1981), pp. 33–35.

    Article  Google Scholar 

  7. P. Hell and D.G. Kirkpatrick. Packing by cliques and by finite families of graphs. Discrete Mathematics 49 (1984), pp. 45–59.

    Article  Google Scholar 

  8. P. Hell and D.G. Kirkpatrick. Packings by complete bipartite graphs. SIAM Journal on Algebraic and Discrete Methods 7 (1986), pp. 199–209.

    Google Scholar 

  9. J. Hopcroft and R. Karp. An n 5/2 algorithm for maximum matching in bipartite graphs. SIAM J.Comput., 4:4, 1975.

    Google Scholar 

  10. D.G. Kirkpatrick and P. Hell. Proc. 10th Annual ACM Symposium on Theory of Computing, 1978, pp. 240–245.

    Google Scholar 

  11. D.G. Kirkpatrick and P. Hell. On the complexity of general factor problems. SIAM Journal on Computing 12 (1983), pp. 601–609.

    Article  Google Scholar 

  12. A. Lingas and M. Karpinski. Subtree Isomorphism is NC reducible to Bipartite Perfect Matching. Information Processing Letters 30(1989), pp. 27–32.

    Article  Google Scholar 

  13. D. Matula An algorithm for subtree identification (abstract). SIAM Rev. 10 (1968), pp. 273–274.

    Google Scholar 

  14. D. Matula. Subtree isomorphism in O(n 5/2). Annals of Discrete Mathematics 2 (1978), pp. 91–106.

    Google Scholar 

  15. J. Matousek and R. Thomas. On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Mathematics 108 (1992), pp. 343–364.

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. R.M. Verma and S. W. Reyner. An analysis of a good algorithm for the subtree problem, corrected. SIAM J. Comput. 18,5 (1989), pp. 906–908.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Comptuter Science, Lund University, Box 118, S-221 00, Lund, Sweden

    Andrzej Lingas

Authors
  1. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lingas, A. (1995). Maximum tree-packing in time O(n5/2). In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030826

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation