Finding small separators in linear time via treewidth reduction

@article{Marx2013FindingSS,
  title={Finding small separators in linear time via treewidth reduction},
  author={D. Marx and B. O'Sullivan and I. Razgon},
  journal={ACM Trans. Algorithms},
  year={2013},
  volume={9},
  pages={30:1-30:35}
}
  • D. Marx, B. O'Sullivan, I. Razgon
  • Published 2013
  • Mathematics, Computer Science
  • ACM Trans. Algorithms
  • We present a method for reducing the treewidth of a graph while preserving all of its minimal <i>s</i>-<i>t</i> separators up to a certain fixed size <i>k</i>. This technique allows us to solve <i>s</i>-<i>t</i> <scp>Cut</scp> and <scp>Multicut</scp> problems with various additional restrictions (e.g., the vertices being removed from the graph form an independent set or induce a connected graph) in linear time for every fixed number <i>k</i> of removed vertices. Our results have applications… CONTINUE READING
    85 Citations
    Minimum bisection is fixed parameter tractable
    • 34
    • PDF
    On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
    • 4
    • PDF
    On the Parameterized Complexity of Computing Balanced Partitions in Graphs
    • 14
    • Highly Influenced
    • PDF
    Parameterized complexity dichotomy for Steiner Multicut
    • 4
    • PDF
    Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
    • 3
    • PDF
    Parameterized Complexity Dichotomy for Steiner Multicut
    • 6
    • PDF
    Parameterized Complexity Dichotomy for Steiner Multicut (Full Version)
    Parameterized complexity of critical node cuts
    • 3
    • PDF
    Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
    • 1

    References

    SHOWING 1-10 OF 15 REFERENCES
    FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
    • 22
    • Highly Influential
    An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
    • 64
    • Highly Influential
    Invitation to fixed-parameter algorithms
    • 477
    • Highly Influential
    • PDF
    Correlation clusterin g
    • Machine Learning, 56(1-3):89–113,
    • 2004
    INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
    • 20
    • Highly Influential
    Invitation to fixed-parameter algorithms , volume 31 ofOxford Lecture Series in Mathematics and its Applications
    • Oxford University Press, Oxford,
    • 2006
    Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications
    • Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications
    • 2006
    Minimum cost h omomorphisms to reflexive digraphs
    • LATIN, pages 182–193,
    • 2008
    Parameterized Complexity. Monographs in Computer Science
    • Parameterized Complexity. Monographs in Computer Science
    • 1999
    Saving space by algebrai zation
    • InSTOC, pages 321–330,
    • 2010