Pages that link to "Item:Q848843"
From MaRDI portal
The following pages link to Approximation algorithms for treewidth (Q848843):
Displaying 45 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- An improvement of Reed's treewidth approximation (Q2232243) (← links)
- Algorithms and complexity for Turaev-Viro invariants (Q2316773) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- Practical approximation algorithms for zero- and bounded-skew trees (Q2768326) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- On treewidth approximations (Q2816043) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- On exact algorithms for treewidth (Q2933641) (← links)
- Treewidth and the Computational Complexity of MAP Approximations (Q2938412) (← links)
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (Q3587419) (← links)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821) (← links)
- (Q4407447) (← links)
- An Improvement of Reed’s Treewidth Approximation (Q5049997) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- (Q5150424) (← links)
- Treewidth: Structure and Algorithms (Q5425956) (← links)
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth (Q5434404) (← links)
- Automata, Languages and Programming (Q5466494) (← links)
- Fast Counting with Bounded Treewidth (Q5505573) (← links)
- (Q5743430) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)
