A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars

DOI10.1007/S002240000115MaRDI QIDQ1281933zbMATH OpenOpenAlexFDO

Authors Frank Drewes

Publication date 22 March 1999

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000115

zbMATH Keywords

hyperedge-replacement graph grammarslanguages of hypertrees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 809155
• scientific article; zbMATH DE number 5018643
• scientific article; zbMATH DE number 4035178
• scientific article; zbMATH DE number 5842462
• The complexity of graph languages generated by hyperedge replacement
• On hyperedge replacement and BNLC graph grammars
• scientific article; zbMATH DE number 219258
• scientific article; zbMATH DE number 522845
• An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
• Hyperedge replacement: grammars and languages

Cited in

(8)

• Characteristics of graph languages generated by edge replacement
• Tree-based picture generation
• scientific article; zbMATH DE number 1504824 (Why is no real title available?)
• scientific article; zbMATH DE number 1361481 (Why is no real title available?)
• scientific article; zbMATH DE number 809155 (Why is no real title available?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• On the power of local graph expansion grammars with and without additional restrictions
• Recognising k-connected hypergraphs in cubic time

This page was built for publication: A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars

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