scientific article
From MaRDI portal
Publication:4037325
zbMath0765.68160MaRDI QIDQ4037325
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitygraph algorithmdecidabilitytree automatagraph grammarstree-widthhyperedge-replacement
Trees (05C05) Applications of graph theory (05C90) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Grammars and rewriting systems (68Q42)
Related Items (5)
Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Transduction from trees to graphs through folding ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Unnamed Item ⋮ Generating irregular partitionable data structures
This page was built for publication: