scientific article
From MaRDI portal
Publication:3795251
zbMath0649.68076MaRDI QIDQ3795251
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilitygraph grammarscomplexity analysiscontext-free graph languagescellular graph grammarefficient combinatorial algorithms
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (12)
Hyperedge replacement with rendezvous ⋮ The monadic second-order logic of graphs. I: Recognizable sets of finite graphs ⋮ Metatheorems for decision problems on hyperedge replacement graph languages ⋮ Graph-theoretic properties compatible with graph derivations ⋮ The monadic second-order logic of graphs : Definable sets of finite graphs ⋮ Algorithms for graph problems on BNLC structured garphs ⋮ Yes, the “missing axiom” of matroid theory is lost forever ⋮ Recognising \(k\)-connected hypergraphs in cubic time ⋮ Recursively indefinite databases ⋮ On matroids and hierarchical graphs ⋮ A Greibach normal form for context-free graph grammars ⋮ A comparison of compatible, finite, and inductive graph properties
This page was built for publication:
