Boundary NLC and partition controlled graph grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 291 LNCS, Issue , 1987, Pages 593-609

  Welzl, Emo ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; POLYNOMIAL APPROXIMATION;

GRAPH GRAMMAR; GRAPH PROPERTIES; POLYNOMIAL-TIME;

GRAPH THEORY;

EID: 85030324764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18771-5_78     Document Type: Conference Paper

References (17)

1. 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).
2. H. Ehrig, D. Janssens, H.-J. Kreowski, and G. Rozenberg, Concurrency of node labelled graph transformations, University of Antwerp, Report 82–38 (1982).
3. M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness. San Francisco: Freeman (1979).
4. 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.
5. 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.
6. A. Habel and H.-J. Kreowski, May we introduce to you: edge replacement, Lecture Notes in Computer Science, this volume.
7. D. Janssens and G. Rozenberg, On the structure of node label controlled graph languages, Inform. Sci. 20 (1980) 191–216.
8. D. Janssens and G. Rozenberg, Restrictions, extensions and variations of NLC grammars, Inform. Sci 20 (1980) 217–244.
9. G. Lackner and E. Welzl, Coloring graphs in boundary NLC languages, manuscript (1987).
10. 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.
11. G. Rozenberg and E. Welzl, Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. and Control 69 (1986) 136–167.
12. G. Rozenberg and E. Welzl, Graph theoretic closure properties of the family of boundary NLC languages, Acta Inform. 23 (1986) 289–309.
13. G. Rozenberg and E. Welzl, Combinatorial properties of boundary NLC graph languages, Discrete Appl. Math. 16 (1987) 59–73.
14. R. Schuster, Graphgrammatiken und Grapheinbettung — Algorithmen und Komplexität, Ph.D. thesis, Universität Passau, West Germany.
15. A.O. Slisenko, Context-free grammars as a tool for describing polynomial-time subclasses of hard problems, Inform. Process. Lett. 14 (1982) 52–56.
16. 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).
17. E. Welzl, Partition controlled graph grammars, manuscript (1987).