scientific article; zbMATH DE number 17563

zbMATH Open0756.68067MaRDI QIDQ3974888FDOQ3974888

Authors: Egon Wanke 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

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

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)

Cited In (5)

• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• Title not available (Why is that?)
• Algorithms for graph problems on BNLC structured garphs
• Title not available (Why is that?)
• 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)