Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Quickly excluding a planar graph
Journal of Combinatorial Theory Series B
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics
Improved Approximation Algorithms for Minimum Weight Vertex Separators
SIAM Journal on Computing
On tree width, bramble size, and expansion
Journal of Combinatorial Theory Series B
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Approximation Algorithms for Treewidth
Algorithmica
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Strengthening Erdös–Pósa property for minor-closed graph classes
Journal of Graph Theory
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
The Bidimensionality Theory and Its Algorithmic Applications 1
The Computer Journal
Hi-index | 0.00 |
Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph G into node-disjoint subgraphs, where each subgraph has sufficiently large treewidth. We prove two theorems on the tradeoff between the number of the desired subgraphs h, and the desired lower bound r on the treewidth of each subgraph. The theorems assert that, given a graph G with treewidth k, a decomposition with parameters h,r is feasible whenever hr2 ≤ k/polylog(k), or h3r ≤ k/polylog(k) holds. We then show a framework for using these theorems to bypass the well-known Grid-Minor Theorem of Robertson and Seymour in some applications. In particular, this leads to substantially improved parameters in some Erdos-Posa-type results, and faster algorithms for some fixed-parameter tractable problems.