The isomorphism problem is polynomially solvable for certain graph languages

  • Manfred Schnitzler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)


Conditions are developed which for all graph grammars satisfying them ensure that the isomorphism problem for the corresponding graph languages is solvable in polynomial time. The suitability of these conditions is proved by the presentation of an algorithm scheme. A large number of graph grammars that satisfy the conditions give rise to the polynomial solvability of the isomorphism problem for graph classes, for which such results are mostly new.


Polynomial Time Graph Class Isomorphism Problem Graph Grammar Algorithm Scheme 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K.S. BOOTH-C.J. COLBOURN, Problems Polynomially Equivalent to Graph Isomorphism, Techn. Rep. CS-77-04, Comp. Sci. Dep., Univ. Waterloo, 1979.Google Scholar
  2. [2]
    C.J. COLBOURN, The Complexity of Graph Isomorphism and Related Problems, Techn. Rep. 142/80 (Ph.D. Thesis), Dep. Comp. Sci., Univ. Toronto, 1980.Google Scholar
  3. [3]
    P. DELLA VIGNA-C. GHEZZI, Context-Free Graph Grammars, Information and Control 37 (1978), 207–233.Google Scholar
  4. [4]
    J.E. HOPCROFT-J.K. WONG, Linear Time Algorithm for Isomorphism of Planar Graphs, Proc. 6th ACM Symp. on Theory of Computing, Seattle (WA), 1974, 172–184.Google Scholar
  5. [5]
    D.S. JOHNSON, The NP-Completeness Column: An Ongoing Guide, Journal of Algorithms 2 (1981), 393–405.Google Scholar
  6. [6]
    M. KAUL, Linear Parsing of Graphs, this volume.Google Scholar
  7. [7]
    E.M. LUKS, Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time, to appear in J. Comp. Syst. Sci.; short version in 21st IEEE Symp. Found. Comp. Sci., 1980, 42–49.Google Scholar
  8. [8]
    M. NAGL, A Tutorial and Bibliographical Survey on Graph Grammars, in “Graph-Grammars and Their Application to Computer Science and Biology” (V. Claus-H. Ehrig-G. Rozenberg, eds.), Lect. Notes Comp. Sci. 73 (1979), 70–126.Google Scholar
  9. [9]
    M. NAGL, “Graph-Grammatiken: Theorie, Implementierung, Anwendungen”, Friedr. Vieweg & Sohn, Braunschweig, 1979.Google Scholar
  10. [10]
    M. SCHNITZLER, Graph Grammars for Acyclic Digraphs, Discussion Paper 8005, Lehrstuhl Informatik III, RWTH Aachen, 1980.Google Scholar
  11. [11]
    M. SCHNITZLER, Untersuchungen zur Komplexität des Graphenisomorphie-Problems mit Hilfe von Graph-Grammatiken, Dissertation, RWTH Aachen, 1982.Google Scholar
  12. [12]
    J. VALDES-R.E. TARJAN-E.L. LAWLER, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing 11 (1982), 298–313.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Manfred Schnitzler
    • 1
  1. 1.Lehrstuhl Informatik IIIRWTH AachenAachenWest Germany

Personalised recommendations