An application of maximum bipartite c-matching to subtree isomorphism'

  • Andrzej Lingas
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 159)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho A., Hopcroft J. and Ullman J., The Design and Analysis of Computer Algorithms Addison-Wesley, Reading Mass., 1974.Google Scholar
  2. [2]
    Berge C., Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.Google Scholar
  3. [3]
    Chandra S., Stockmeyer L., Alternation, Proc. 17th FOCS, 1976, pp. 98–108.Google Scholar
  4. [4]
    Deo M., Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Inc. Englewood Cliffs, N.Y., 1974.Google Scholar
  5. [5]
    Even S., Graph Algorithms, Computer Science Press, Inc., 1979.Google Scholar
  6. [6]
    Hopcroft J., Karp R., An n 5/2 Algorithms for Maximum Matching in Bipartite Graphs, SIAM J.Compt., Vol.4, No.4, 1975.Google Scholar
  7. [7]
    Hopcroft J., Tarjan R., Isomorphism of Planar Graphs, Complexity of Computer Computations, Plenum Press, N.Y. 1972.Google Scholar
  8. [8]
    Matula D., Subtree Isomorphism in O(n 5/2), Annals of Discrete Mathematics 2, North-Holland Publishing Company, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Andrzej Lingas
    • 1
  1. 1.Massachusetts Institute of Technology and Linköping UniversityUSA

Personalised recommendations