Abstract
The paper starts with a discussion of an application of graph grammars as means for determining polynomial-time recognizability of graph properties. Then boundary NLC graph grammars are reviewed with emphasis on the application outlined in the first part. Finally, partition controlled graph grammars are introduced as an extension of boundary NLC graph grammars which still preserves many of the properties of boundary NLC graph grammars and, moreover, allows a simple characterization result.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F.J. Brandenburg, On the complexity of the membership problem for graph grammars, in "Proceedings of the WG 83" (M. Nagl and J. Perl, eds.) pp. 40–49, Linz: Universitaetsverlag Trauner (1983).
H.Ehrig, D.Janssens, H.-J.Kreowski, and G.Rozenberg, Concurrency of node labelled graph transformations, University of Antwerp, Report 82–38 (1982).
M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness. San Francisco: Freeman (1979).
E.H. Gurari and I.H. Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problem, J. Algorithms 5 (1984) 531–546.
A. Habel and H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement, Lecture Notes in Computer Science 247 (1987) 207–219.
A.Habel and H.-J. Kreowski, May we introduce to you: edge replacement, Lecture Notes in Computer Science, this volume.
D. Janssens and G. Rozenberg, On the structure of node label controlled graph languages, Inform. Sci. 20 (1980) 191–216.
D. Janssens and G. Rozenberg, Restrictions, extensions and variations of NLC grammars, Inform. Sci 20 (1980) 217–244.
G.Lackner and E.Welzl, Coloring graphs in boundary NLC languages, manuscript (1987).
K.-J. Lange and E. Welzl, String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing, Descrete Appl. Math. 16 (1987) 17–30.
G. Rozenberg and E. Welzl, Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. and Control 69 (1986) 136–167.
G. Rozenberg and E. Welzl, Graph theoretic closure properties of the family of boundary NLC languages, Acta Inform. 23 (1986) 289–309.
G. Rozenberg and E. Welzl, Combinatorial properties of boundary NLC graph languages, Discrete Appl. Math. 16 (1987) 59–73.
R.Schuster, Graphgrammatiken und Grapheinbettung — Algorithmen und Komplexität, Ph.D. thesis, Universität Passau, West Germany.
A.O. Slisenko, Context-free grammars as a tool for describing polynomial-time subclasses of hard problems, Inform. Process. Lett. 14 (1982) 52–56.
E. Welzl, On the set of all subgraphs of the graphs in a boundary NLC graph language, in "The Book of L (G. Rozenberg and A. Salomaa, eds.), pp. 445–459, Berlin, Heidelberg, New York: Springer (1986).
E.Welzl, Partition controlled graph grammars, manuscript (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Welzl, E. (1987). Boundary NLC and partition controlled graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1986. Lecture Notes in Computer Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18771-5_78
Download citation
DOI: https://doi.org/10.1007/3-540-18771-5_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18771-4
Online ISBN: 978-3-540-48178-2
eBook Packages: Springer Book Archive