Apex graph grammars
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 167-185
- https://doi.org/10.1007/3-540-18771-5_52
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Apex graph grammarsPublished by Springer Nature ,1987
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- Encoding graphs by derivations and implications for the theory of graph grammarsLecture Notes in Computer Science, 1984
- Graph grammars with neighbourhood-controlled embeddingTheoretical Computer Science, 1982
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on TreesSIAM Journal on Algebraic Discrete Methods, 1982
- On sequential and parallel node-rewriting graph grammarsComputer Graphics and Image Processing, 1982
- Restrictions, extensions, and variations of NLC grammarsInformation Sciences, 1980
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979
- Graph-GrammatikenPublished by Springer Nature ,1979