Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
Data Structures and Algorithms
2016-02-23 v4 Discrete Mathematics
Combinatorics
Abstract
We give two algorithms computing representative families of linear and uniform matroids and demonstrate how to use representative families for designing single-exponential parameterized and exact exponential time algorithms. The applications of our approach include - LONGEST DIRECTED CYCLE - MINIMUM EQUIVALENT GRAPH (MEG) - Algorithms on graphs of bounded treewidth -k-PATH, k-TREE, and more generally, k-SUBGRAPH ISOMORPHISM, where the k-vertex pattern graph is of constant treewidth.
Cite
@article{arxiv.1304.4626,
title = {Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms},
author = {Fedor V. Fomin and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh},
journal= {arXiv preprint arXiv:1304.4626},
year = {2016}
}
Comments
61 pages