scientific article; zbMATH DE number 17563

MaRDI QIDQ3974888zbMATH OpenFDO

Authors Egon Wanke

Publication date 26 June 1992

zbMATH Keywords

graph grammarsgraph rewriting systems

Mathematics Subject Classification ID

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

Recommendations

• The complexity of connectivity problems on context-free graph languages
• scientific article; zbMATH DE number 3852433
• scientific article; zbMATH DE number 4060748
• scientific article; zbMATH DE number 1107740
• scientific article; zbMATH DE number 3872712

Cited in

(5)

• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• scientific article; zbMATH DE number 1222597 (Why is no real title available?)
• Algorithms for graph problems on BNLC structured garphs
• scientific article; zbMATH DE number 3917735 (Why is no real title available?)
• Recursively indefinite databases

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 Q3974888)