Pages that link to "Item:Q4895809"
From MaRDI portal
The following pages link to Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (Q4895809):
Displaying 18 items.
- A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5899362) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- On the complexity of the storyplan problem (Q6078287) (← links)
- Dynamic algorithms for graphs with treewidth 2 (Q6143969) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
- Sum-of-local-effects data structures for separable graphs (Q6591471) (← links)
- On the routing problems in graphs with ordered forbidden transitions (Q6591488) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)