Advertisement

Certain algorithms for subgraph isomorphism problems

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

Keywords

Planar Graph Search Tree Input Graph Winning Strategy Pattern Graph 
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]
    Aho A.V., Hopcroft J.E., Ullman J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1976.Google Scholar
  2. [2]
    Filotti I.S., Mayer J.N., Apolynomial-time algorithm for determining the isomorphism of graphs of fixed genus, ACM symposium on Theory of Computing, 1980.Google Scholar
  3. [3]
    Garey M.R., Johnson D.S. and Tarjan R.E., The planar Hamiltonian circuit problem is NP-complete, SIAM J. Compt. vol 5, no 4, 1976.Google Scholar
  4. [4]
    Gonzalez R.C., Tou J.T., Pattern Recognition Principles, Addison-Wesley, Massachusetts, 1974.Google Scholar
  5. [5]
    Harary F., Graph Theory, Addison-Wesley, 1969.Google Scholar
  6. [6]
    Hopcroft J.E., Wong J., Linear time Algorithm for Isomorphism of Planar Graphs, 6th ACM symp. on Theory of Computing, 1974.Google Scholar
  7. [7]
    Hopcroft J.E., Tarjan R., Isomorphism of planar graphs, 4th An. Symp. on the Theory of Computing, 1972.Google Scholar
  8. [8]
    Hopcroft J.E., Karp R.M., An n5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Compt. vol 2, 1973.Google Scholar
  9. [9]
    Leiserson C.E., Area-Efficient Graph Layouts, 21 st FOCS symposium, 1980.Google Scholar
  10. [10]
    Lipton R.J., Tarjan R.E., A separator theorem for planar graphs, Stanford Univ. 1977, CS-77-627.Google Scholar
  11. [11]
    Lipton R.J., Tarjan R.E., Applications of a planar separator theorem, Stanford Univ. 1977, CS-77-628.Google Scholar
  12. [12]
    Miller G., Isomorphism testing for graphs of bounded genus, ACM symposium on Theory of Computing, 1980.Google Scholar
  13. [13]
    Read R.C., Corneil D.G., The graph isomorphism disease, J. of Graph Theory, no 4, 1977.Google Scholar
  14. [14]
    Schmidt D.C., Druffel L. E., A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices, J.ACM, 1976, 433–445.Google Scholar
  15. [15]
    Ullmann J.R., An algorithm for subgraph isomorphism, J.ACM, vol 23, no 1, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Andrzej Lingas
    • 1
    • 2
  1. 1.Instytut MatematykiUniwersytet WarszawskiUSA
  2. 2.Laboratory for Computer ScienceMassachusetts Institute of TechnologyUSA

Personalised recommendations