Node replacements in embedding normal form.

DOI10.1006/JCSS.2002.1851MaRDI QIDQ1872709zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1504826
• scientific article; zbMATH DE number 5556284
• Publication:4502809
• Extensions in graph normal form
• Node replacement graph languages squeezed with chains, trees, and forests
• Node replacement graph grammars with dynamic node relabeling
• scientific article; zbMATH DE number 51713
• Embeddings of graphs
• Node rewriting in graphs and hypergraphs: A categorical framework

Cites work

• A comparison of boundary graph grammars and context-free hypergraph grammars
• Algorithms for graph problems on BNLC structured garphs
• Boundary graph grammars with dynamic edge relabeling
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Decision problems for node label controlled graph grammars
• Efficient decision procedures for graph properties on context-free graph languages
• Emptiness problems of eNCE graph languages
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• 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
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 3888930 (Why is no real title available?)
• scientific article; zbMATH DE number 1504826 (Why is no real title available?)
• Linear graph grammars: Power and complexity
• Order independent NCE grammars recognized in polynomial time
• Restrictions, extensions, and variations of NLC grammars
• The bounded degree problem for eNCE graph grammars
• The complexity of graph languages generated by hyperedge replacement
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(2)

• Node replacement graph grammars with dynamic node relabeling
• scientific article; zbMATH DE number 1504826 (Why is no real title available?)

This page was built for publication: Node replacements in embedding normal form.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872709)