Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
On Local Search and Placement of Meters in Networks
SIAM Journal on Computing
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Reducing to independent set structure: the case of k-internal spanning tree
Nordic Journal of Computing
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Inclusion--Exclusion Algorithms for Counting Set Partitions
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum Leaf Out-Branching Problems
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Exact and Parameterized Algorithms for Max Internal Spanning Tree
Graph-Theoretic Concepts in Computer Science
A Linear Vertex Kernel for Maximum Internal Spanning Tree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A moderately exponential time algorithm for full degree spanning tree
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Finding odd cycle transversals
Operations Research Letters
Hi-index | 0.00 |
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset of vertices, referred to as a separator. In this paper we prove a trade-off between the size of the separator and the sharpness with which we can fix the size of the two sides of the partition. Our result appears to be a handy and powerful tool for the design of exact and parameterized algorithms for NP-hard problems. We illustrate that by presenting two applications. Our first application is a parameterized algorithm with running time O(16k+o(k)+nO(1)) for the Maximum Internal Subtree problem in directed graphs. This is a significant improvement over the best previously known parameterized algorithm for the problem by [Cohen et al.’09], running in time O(49.4k+nO(1)). The second application is a O(2n+o(n)) time and space algorithm for the Degree Constrained Spanning Tree problem: find a spanning tree of a graph with the maximum number of nodes satisfying given degree constraints. This problem generalizes some well-studied problems, among them Hamiltonian Path, Full Degree Spanning Tree, Bounded Degree Spanning Tree, Maximum Internal Spanning Tree and their edge weighted variants.