Graph theoretic closure properties of the family of boundary NLC graph languages
- 1 June 1986
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 23 (3) , 289-309
- https://doi.org/10.1007/bf00289115
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Graph grammars with node-label controlled rewriting and embeddingPublished by Springer Nature ,2005
- Introduction to the algebraic theory of graph grammars (a survey)Published by Springer Nature ,2005
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- Restrictions on NLC graph grammarsTheoretical Computer Science, 1984
- Decision problems for node label controlled graph grammarsJournal of Computer and System Sciences, 1981
- Restrictions, extensions, and variations of NLC grammarsInformation Sciences, 1980
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969