Node replacement in hypergraphs: Translating NCE rewriting into the pullback approach

DOI10.1007/978-3-540-46464-8_9MaRDI QIDQ4502809zbMATH OpenFDO

Authors H. Jacquet, Renate Klempien-Hinrichs

Publication date 12 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-46464-8_9

zbMATH Keywords

node replacementtransformation of graphs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
• Node rewriting in graphs and hypergraphs: A categorical framework
• Pullback as a generic graph rewriting mechanism
• Context-free hypergraph grammars with node rewriting
• Pullback rewriting and applications

Cited in

(8)

• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• Node replacements in embedding normal form.
• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Pullback rewriting and applications
• Pullback as a generic graph rewriting mechanism
• Node rewriting in graphs and hypergraphs: A categorical framework
• Node rewriting in hypergraphs

This page was built for publication: Node replacement in hypergraphs: Translating NCE rewriting into the pullback approach

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