Publication:3795251
From MaRDI portal
zbMath0649.68076MaRDI QIDQ3795251
Publication date: 1988
decidability; graph grammars; complexity analysis; context-free graph languages; cellular graph grammar; efficient combinatorial algorithms
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Related Items
Recognising \(k\)-connected hypergraphs in cubic time, Recursively indefinite databases, Metatheorems for decision problems on hyperedge replacement graph languages, Algorithms for graph problems on BNLC structured garphs, A comparison of compatible, finite, and inductive graph properties, The monadic second-order logic of graphs. I: Recognizable sets of finite graphs