Node replacements in embedding normal form.
From MaRDI portal
Publication:1872709
DOI10.1006/jcss.2002.1851zbMath1059.68053OpenAlexW1991986562MaRDI QIDQ1872709
Konstantin Skodinis, Egon Wanke
Publication date: 14 May 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2002.1851
Cites Work
- Unnamed Item
- Unnamed Item
- Boundary graph grammars with dynamic edge relabeling
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Restrictions, extensions, and variations of NLC grammars
- Decision problems for node label controlled graph grammars
- Algorithms for graph problems on BNLC structured garphs
- Order independent NCE grammars recognized in polynomial time
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- The bounded degree problem for eNCE graph grammars
- Linear graph grammars: Power and complexity
- Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
- Emptiness problems of eNCE graph languages
- The complexity of graph languages generated by hyperedge replacement
- Handle-rewriting hypergraph grammars
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Handbook of Graph Grammars and Computing by Graph Transformation
- Efficient decision procedures for graph properties on context-free graph languages
This page was built for publication: Node replacements in embedding normal form.
