Graph theoretic closure properties of the family of boundary NLC graph languages
Authors:
- 1 June 1986
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 23 (3) , 289-309
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The bounded degree problem for NLC grammars is decidableJournal of Computer and System Sciences, 1986
- 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
- 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
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Graph Theory with Applications1976
- GRAPH THEORY1969