Graph-theoretic properties compatible with graph derivations
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On context-free graph languages generated by edge replacementPublished by Springer Nature ,2005
- Decomposition trees: Structured graph representation and efficient algorithmsPublished by Springer Nature ,2005
- Some structural aspects of hypergraph languages generated by hyperedge replacementPublished by Springer Nature ,2005
- Efficient analysis of graph properties on context-free graph languagesPublished by Springer Nature ,1988
- May we introduce to you: Hyperedge replacementPublished by Springer Nature ,1987
- Characteristics of graph languages generated by edge replacementTheoretical Computer Science, 1987
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Graph theoretic closure properties of the family of boundary NLC graph languagesActa Informatica, 1986
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problemsInformation Processing Letters, 1982
- Graph-Grammars and Their Application to Computer Science and BiologyPublished by Springer Nature ,1979