This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho A., Hopcroft J. and Ullman J., The Design and Analysis of Computer Algorithms Addison-Wesley, Reading Mass., 1974.
Berge C., Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
Chandra S., Stockmeyer L., Alternation, Proc. 17th FOCS, 1976, pp. 98–108.
Deo M., Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Inc. Englewood Cliffs, N.Y., 1974.
Even S., Graph Algorithms, Computer Science Press, Inc., 1979.
Hopcroft J., Karp R., An n 5/2 Algorithms for Maximum Matching in Bipartite Graphs, SIAM J.Compt., Vol.4, No.4, 1975.
Hopcroft J., Tarjan R., Isomorphism of Planar Graphs, Complexity of Computer Computations, Plenum Press, N.Y. 1972.
Matula D., Subtree Isomorphism in O(n 5/2), Annals of Discrete Mathematics 2, North-Holland Publishing Company, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lingas, A. (1983). An application of maximum bipartite c-matching to subtree isomorphism'. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-12727-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12727-7
Online ISBN: 978-3-540-38714-5
eBook Packages: Springer Book Archive