An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars

DOI10.1007/978-3-540-87405-8_4zbMath1175.68228OpenAlexW1571058127MaRDI QIDQ3540387

Mark Minas, Sonja Maier, Steffen Mazanek

Publication date: 20 November 2008

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-87405-8_4

zbMATH Keywords

parsinghyperedge replacementhypergraph completion

Mathematics Subject Classification ID

Hypergraphs (05C65) Grammars and rewriting systems (68Q42) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• AToM3
• DiaGen

Cites Work

• Concepts and realization of a diagram editor generator based on hypergraph transformation
• The complexity of graph languages generated by hyperedge replacement
• Functional-Logic Graph Parser Combinators
• Handbook of Graph Grammars and Computing by Graph Transformation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars