scientific article; zbMATH DE number 1059243
From MaRDI portal
Publication:4353558
zbMath0883.03004MaRDI QIDQ4353558
No author found.
Publication date: 23 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
graph propertiesexpressive powerforbidden configurationsdescriptional complexityfragments of monadic second-order logic
Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Second- and higher-order model theory (03C85)
Related Items (19)
Theorem proving graph grammars with attributes and negative application conditions ⋮ Automatic graphs and D0L-sequences of finite graphs ⋮ On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Unnamed Item ⋮ Logical description of context-free graph languages ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ On the planar split thickness of graphs ⋮ GETGRATS ⋮ Evaluation diversity for graph conditions ⋮ Parameterized shifted combinatorial optimization ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ Approximating max-cut under graph-MSO constraints ⋮ Origin-equivalence of two-way word transducers is in PSPACE ⋮ Regular transducer expressions for regular transformations ⋮ The monadic second-order logic of graphs. XII: Planar graphs and planar maps ⋮ Parameterized leaf power recognition via embedding into graph products ⋮ Evaluation diversity for graph conditions
This page was built for publication:
