The isomorphism problem is polynomially solvable for certain graph languages
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Manfred Schnitzler
The isomorphism problem is polynomially solvable for certain graph languages
ICGT, 1982.

GG 1982
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{GG-1982-Schnitzler,
	author        = "Manfred Schnitzler",
	booktitle     = "{Proceedings of the Second International Workshop on Graph-Grammars and Their Application to Computer Science}",
	doi           = "10.1007/BFb0000119",
	editor        = "Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg",
	isbn          = "3-540-12310-5",
	pages         = "369--379",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{The isomorphism problem is polynomially solvable for certain graph languages}",
	volume        = 153,
	year          = 1982,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.