Treewidth reduction for constrained separation and bipartization problems
From MaRDI portal
Publication:3113780
DOI10.4230/LIPIcs.STACS.2010.2485zbMath1230.68113OpenAlexW2964011138MaRDI QIDQ3113780
Igor Razgon, Barry O'Sullivan, Dániel Marx
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_8571.html
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal ⋮ Parameterizing cut sets in a graph by the number of their components ⋮ On the parameterized complexity of finding separators with non-hereditary properties ⋮ On parameterized independent feedback vertex set ⋮ An FPT algorithm for matching cut and d-cut
This page was built for publication: Treewidth reduction for constrained separation and bipartization problems
