scientific article

zbMath0765.68084MaRDI QIDQ4037313

Joost Engelfriet, Grzegorz Rozenberg

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hypergraphgraph grammarsrecursive systems of equations

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (17)

Tree-depth and vertex-minors ⋮ Handle-rewriting hypergraph grammars ⋮ The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ Synthesis for Structure Rewriting Systems ⋮ Satisfiability of acyclic and almost acyclic CNF formulas ⋮ A SAT Approach to Clique-Width ⋮ On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) ⋮ Polynomial graph invariants from homomorphism numbers ⋮ The monadic second-order logic of graphs. VII: Graphs as relational structures ⋮ Pursuing a fast robber on a graph ⋮ On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth ⋮ Succinct data structures for bounded clique-width graphs ⋮ Clique-width of point configurations ⋮ The NLC-width and clique-width for powers of graphs of bounded tree-width ⋮ Generating irregular partitionable data structures ⋮ Unnamed Item ⋮ Hypergraph languages of bounded degree

This page was built for publication: