Graph-theoretic properties compatible with graph derivations
From MaRDI portal
Publication:6203538
Recommendations
Cites work
- scientific article; zbMATH DE number 3827231 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4049099 (Why is no real title available?)
- scientific article; zbMATH DE number 4053039 (Why is no real title available?)
- scientific article; zbMATH DE number 4060749 (Why is no real title available?)
- scientific article; zbMATH DE number 4087049 (Why is no real title available?)
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Characteristics of graph languages generated by edge replacement
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
- Graph theoretic closure properties of the family of boundary NLC graph languages
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
This page was built for publication: Graph-theoretic properties compatible with graph derivations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203538)