Advertisement

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

  • Andrzej Lingas
Session 3A: Graph Algorithms
  • 125 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)

Abstract

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

Keywords

Bipartite Graph Match Problem Maximum Match Subgraph Isomorphism Root Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    F. Berman, D. Johnson, T. Leighton, P.W. Shor, and L. Snyder. Generalized planar matching. Journal of Algorithms, 11 (1990), pp. 153–184.CrossRefGoogle Scholar
  3. [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. [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. [5]
    F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1979.Google Scholar
  6. [6]
    P. Hell and D.G. Kirkpatrick. On generalized matching problems. Information Processing Letters 12 (1981), pp. 33–35.CrossRefGoogle Scholar
  7. [7]
    P. Hell and D.G. Kirkpatrick. Packing by cliques and by finite families of graphs. Discrete Mathematics 49 (1984), pp. 45–59.CrossRefGoogle Scholar
  8. [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. [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. [10]
    D.G. Kirkpatrick and P. Hell. Proc. 10th Annual ACM Symposium on Theory of Computing, 1978, pp. 240–245.Google Scholar
  11. [11]
    D.G. Kirkpatrick and P. Hell. On the complexity of general factor problems. SIAM Journal on Computing 12 (1983), pp. 601–609.CrossRefGoogle Scholar
  12. [12]
    A. Lingas and M. Karpinski. Subtree Isomorphism is NC reducible to Bipartite Perfect Matching. Information Processing Letters 30(1989), pp. 27–32.CrossRefGoogle Scholar
  13. [13]
    D. Matula An algorithm for subtree identification (abstract). SIAM Rev. 10 (1968), pp. 273–274.Google Scholar
  14. [14]
    D. Matula. Subtree isomorphism in O(n 5/2). Annals of Discrete Mathematics 2 (1978), pp. 91–106.Google Scholar
  15. [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.CrossRefGoogle Scholar
  16. [16]
    S. W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM J. Comput. 6 (1977), 730–732.CrossRefGoogle Scholar
  17. [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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Andrzej Lingas
    • 1
  1. 1.Department of Comptuter ScienceLund UniversityLundSweden

Personalised recommendations