Pages that link to "Item:Q4210129"
From MaRDI portal
The following pages link to Parallel Algorithms with Optimal Speedup for Bounded Treewidth (Q4210129):
Displaying 35 items.
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- Girth and treewidth (Q707020) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- On the colored Tutte polynomial of a graph of bounded treewidth (Q2492206) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- (Q3304104) (← links)
- (Q3305348) (← links)
- An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (Q3464472) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- (Q5075784) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- (Q5111875) (← links)
- (Q5136270) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)
- On the parameterized complexity of freezing dynamics (Q6499443) (← links)
