Directed Nowhere Dense Classes of Graphs
From MaRDI portal
Publication:5417630
zbMath1288.05282arXiv1104.3808MaRDI QIDQ5417630
Stephan Kreutzer, Siamak Tazari
Publication date: 22 May 2014
Full work available at URL: https://arxiv.org/abs/1104.3808
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Between treewidth and clique-width ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking ⋮ First-order Logic with Connectivity Operators ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Algorithmic meta-theorems for restrictions of treewidth ⋮ Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ On the impact of treewidth in the computational complexity of freezing dynamics
