The following pages link to On treewidth approximations. (Q1427177):
Displaying 16 items.
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- On treewidth approximations (Q2816043) (← links)
- Treewidth and the Computational Complexity of MAP Approximations (Q2938412) (← links)
- (Q5150424) (← links)
- (Q5150500) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)