Efficient algorithms on context-free graph languages
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- May we introduce to you: Hyperedge replacementPublished by Springer Nature ,1987
- On Some Variants of the Bandwidth Minimization ProblemSIAM Journal on Computing, 1984
- Graph-Grammars and Their Application to Computer SciencePublished by Springer Nature ,1983
- AlternationJournal of the ACM, 1981
- Restrictions, extensions, and variations of NLC grammarsInformation Sciences, 1980
- Graph-Grammars and Their Application to Computer Science and BiologyPublished by Springer Nature ,1979
- Context-free graph grammarsInformation and Control, 1978
- Linear and Context-Free Graph GrammarsJournal of the ACM, 1972
- Plex languagesInformation Sciences, 1971
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965