scientific article
From MaRDI portal
Publication:3789084
zbMath0645.68074MaRDI QIDQ3789084
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completepolynomial timedata structuregraph languagescontext-free graph grammarsbounded label sizedecomposition treesedge replacement grammars
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (15)
The translation power of top-down tree-to-graph transducers ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ 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 ⋮ The string generating power of context-free hypergraph grammars ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Recognising \(k\)-connected hypergraphs in cubic time ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ The complexity of graph languages generated by hyperedge replacement ⋮ A Greibach normal form for context-free graph grammars ⋮ Unnamed Item ⋮ A partial k-arboretum of graphs with bounded treewidth ⋮ Generating irregular partitionable data structures ⋮ On hyperedge replacement and BNLC graph grammars
This page was built for publication:
