Skip to Main content Skip to Navigation
Conference papers

Multicut is FPT

Nicolas Bousquet 1 Jean Daligault 1 Stéphan Thomassé 1 
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Let G=(V,E) be a graph on n vertices and R be a set of pairs of vertices in V called requests. A multicut is a subset F of E such that every request xy of R is cut by F, i.e. every xy-path of G intersects F. We show that there exists an O(f(k)nc) algorithm which decides if there exists a multicut of size at most k. In other words, the Multicut problem parameterized by the solution size k is Fixed-Parameter Tractable.
Document type :
Conference papers
Complete list of metadata
Contributor : Nicolas Bousquet Connect in order to contact the contributor
Submitted on : Monday, October 15, 2012 - 3:17:45 PM
Last modification on : Friday, August 5, 2022 - 3:02:53 PM


  • HAL Id : lirmm-00741933, version 1



Nicolas Bousquet, Jean Daligault, Stéphan Thomassé. Multicut is FPT. STOC'11: Symposium on Theory of Computing, United States. pp.459-468. ⟨lirmm-00741933⟩



Record views