Pages that link to "Item:Q5425956"
From MaRDI portal
The following pages link to Treewidth: Structure and Algorithms (Q5425956):
Displaying 12 items.
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- (Q4691905) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
