scientific article; zbMATH DE number 3888930

MaRDI QIDQ3221428zbMATH OpenFDO

Authors Emo Welzl

Publication date 1984

zbMATH Keywords

graph grammargrowing normal formsmembership complexityspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3852433
• scientific article; zbMATH DE number 3872712
• Linear graph grammars: Power and complexity
• scientific article; zbMATH DE number 4049103
• scientific article; zbMATH DE number 3885330

Cited in

(8)

• Power properties of NLC graph grammars with a polynomial membership problem
• Representing graph families with edge grammars
• Node replacements in embedding normal form.
• Solving Coverage Problems with Embedded Graph Grammars
• Short Encodings of Evolving Structures
• scientific article; zbMATH DE number 1539544 (Why is no real title available?)
• Graph Grammar Extraction from Source Code
• Boundary graph grammars with dynamic edge relabeling

This page was built for publication:

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