Subgraph isomorphism for biconnected outerplanar graphs in cubic time

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AHU74]
    A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts.Google Scholar
  2. [GJ79]
    M.R. Garey, D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman, San Francisco.Google Scholar
  3. [H69]
    F. Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts.Google Scholar
  4. [HT80]
    J. Hopcroft, R.E. Tarjan, Isomorphism of planar graphs, Proc. 4th Ann. Symposium on Theory of Computing.Google Scholar
  5. [Li85]
    A. Lingas, Subgraph Isomorphism for Easily Separable Graphs of Bounded Valence, 11th Workshop on Graph-theoretic Concepts in Computer Science, Castle Schwanberg.Google Scholar
  6. [Lu80]
    E.M. Luks, Isomorphism of bounded valence can be tested in polynomial time, in Proc. 21st Ann. Symposium of Foundations of Computer Science, IEEE.Google Scholar
  7. [Ma78]
    D. W. Matula, Subtree isomorphism in O(n 5/2), Annals of Discrete Mathematics 2, 91–106.Google Scholar
  8. [Mil80]
    G. Miller, Isomorphism testing for graphs of bounded genus, Proc. Ann. 12th ACM symposium on Theory of Computing.Google Scholar
  9. [Mit79]
    S.L. Mitchell, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Inf. Proces. Let., vol. 9, no. 5.Google Scholar
  10. [Mo81]
    D.M. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity, manuscript, Purdue University.Google Scholar
  11. [Re77]
    S. W. Reyner, An analysis of a good algorithm for the subtree problem, SIAM J. Comput. 6, 730–732.Google Scholar
  12. [S82]
    M.M. Sysło, The subgraph isomorphism problem for outerplanar graphs, Theoretical Computer Science 17, 91–97.Google Scholar
  13. [S85]
    M.M. Sysło, Personal Communication, 1985.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Andrzej Lingas
    • 1
  1. 1.Linköping UniversitySweden

Personalised recommendations