Pages that link to "Item:Q2912741"
From MaRDI portal
The following pages link to When Trees Grow Low: Shrubs and Fast MSO1 (Q2912741):
Displaying 21 items.
- Tree-depth and vertex-minors (Q281932) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
- Limits of structures and the example of tree semi-lattices (Q2012557) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- (Q4625695) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- (Q5002812) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- (Q5111886) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- On low rank-width colorings (Q5918207) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
