Manfred Schnitzler The isomorphism problem is polynomially solvable for certain graph languages. [Citation Graph (0, 0)][DBLP] Graph-Grammars and Their Application to Computer Science, 1982, pp:369-379 [Conf]
Manfred Schnitzler Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs. [Citation Graph (0, 0)][DBLP] WG, 1980, pp:137-149 [Conf]
Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP