Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
The graph genus problem is NP-complete
Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Graph minors. XII: distance on a surface
Journal of Combinatorial Theory Series B
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
SIAM Journal on Discrete Mathematics
Journal of Combinatorial Theory Series B
Computing vertex connectivity: new bounds from old techniques
Journal of Algorithms
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
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)
The Bidimensional Theory of Bounded-Genus Graphs
SIAM Journal on Discrete Mathematics
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
SIAM Journal on Computing
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs
Discrete & Computational Geometry
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On self duality of pathwidth in polyhedral graph embeddings
Journal of Graph Theory
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Analytic Combinatorics
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Fast subexponential algorithm for non-local problems on graphs of bounded genus
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Faster parameterized algorithms for minor containment
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized Complexity
Hi-index | 0.00 |
We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2O(k⋅log k) ⋅ n steps. Our approach combines tools from topological graph theory and analytic combinatorics. In particular, we introduce a new type of branch decomposition called surface cut decomposition, generalizing sphere cut decompositions of planar graphs, which has nice combinatorial properties. Namely, the number of partial solutions that can be arranged on a surface cut decomposition can be upper-bounded by the number of noncrossing partitions on surfaces with boundary. It follows that partial solutions can be represented by a single-exponential (in the branchwidth k) number of configurations. This proves that, when applied on surface cut decompositions, dynamic programming runs in 2O(k) ⋅ n steps. That way, we considerably extend the class of problems that can be solved in running times with a single-exponential dependence on branchwidth and unify/improve most previous results in this direction.