Obtaining a Bipartite Graph by Contracting Few Edges - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2011

Obtaining a Bipartite Graph by Contracting Few Edges


We initiate the study of the Bipartite Contraction problem from the perspective of param- eterized complexity. In this problem we are given a graph G on n vertices and an integer k, and the task is to determine whether we can obtain a bipartite graph from G by a sequence of at most k edge contractions. Our main result is an $f(k)n^{O(1)}$ time algorithm for Bipartite Con- traction. Despite a strong resemblance between Bipartite Contraction and the classical Odd Cycle Transversal (OCT) problem, the methods developed to tackle OCT do not seem to be directly applicable to Bipartite Contraction. To obtain our result, we combine several techniques and concepts that are central in parameterized complexity: iterative compression, irrelevant vertex, and important separators. To the best of our knowledge, this is the first time the irrelevant vertex technique and the concept of important separators are applied in unison. Furthermore, our algorithm may serve as a comprehensible example of the usage of the irrelevant vertex technique.
Fichier principal
Vignette du fichier
FSTTCS.pdf (482.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00805189 , version 1 (30-06-2021)


Attribution - NonCommercial - NoDerivatives



Pinar Heggerness, Pim Van'T Hof, Daniel Lokshtanov, Christophe Paul. Obtaining a Bipartite Graph by Contracting Few Edges. IARCS 31st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Dec 2011, Mumbai, India. pp.217-228, ⟨10.4230/LIPIcs.FSTTCS.2011.217⟩. ⟨lirmm-00805189⟩
128 View
40 Download



Gmail Facebook X LinkedIn More