The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable

@article{Kawarabayashi2011TheMK,
  title={The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable},
  author={Ken-ichi Kawarabayashi and Mikkel Thorup},
  journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
  year={2011},
  pages={160-169}
}
  • Ken-ichi Kawarabayashi, Mikkel Thorup
  • Published in
    IEEE 52nd Annual Symposium on…
    2011
  • Mathematics, Computer Science
  • We consider the minimum $k$-way cut problem for unweighted undirected graphs with a size bound $s$ on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into $k$ components, or report that this requires cutting more than $s$ edges. We show that this problem is fixed-parameter tractable (FPT) with the standard parameterization in terms of the solution size $s$. More precisely, for $s=O(1)$, we present a quadratic time algorithm. Moreover, we… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 45 CITATIONS

    Fast and Deterministic Approximations for k-Cut

    VIEW 7 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Designing FPT Algorithms for Cut Problems Using Randomized Contractions

    VIEW 9 EXCERPTS
    CITES RESULTS & METHODS
    HIGHLY INFLUENCED

    Minimum bisection is fixed parameter tractable

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Automata, Languages, and Programming

    VIEW 10 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Designing FPT Algorithms for Cut Problems Using Randomized Contractions

    VIEW 7 EXCERPTS
    CITES METHODS, RESULTS & BACKGROUND
    HIGHLY INFLUENCED

    Efficient Algorithms and Data Structures

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS

    Complexity and approximability of the k-way vertex cut

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Parameterized Tractability of Multiway Cut with Parity Constraints

    VIEW 19 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES

    Parameterized graph separation problems

    • Dániel Marx
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2006
    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Minimum k-way cuts via deterministic greedy tree packing

    VIEW 4 EXCERPTS

    A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    an d F

    • R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto
    • Rosamond. Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electr. Notes Theor. Comput. Sci. , 78
    • 2003
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Linear time algorithms for NP-hard problems restricted to partial k-trees

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    A Polynomial Algorithm for the k-cut Problem for Fixed k

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    An improved algorithm for the planar 3-cut proble m

    • X. He
    • J. Algorithms, 12(1):23–37
    • 1991
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    and S

    • N. Bousquet, J. Daligault
    • Thomassé. Multicut is FPT
    • 2010
    VIEW 1 EXCERPT