On structural parameterizations of the matching cut problem
From MaRDI portal
Publication:1708644
DOI10.1007/978-3-319-71147-8_34zbMath1472.68071OpenAlexW2770541954MaRDI QIDQ1708644
Anjeneya Swami Kare, N. R. Aravind, Subrahmanyam Kalyanasundaram
Publication date: 26 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-71147-8_34
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (11)
Vertex partitioning problems on graphs with bounded tree width ⋮ Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms ⋮ Unnamed Item ⋮ Perfectly matched sets in graphs: parameterized and exact computation ⋮ Refined notions of parameterized enumeration kernels with applications to matching cut enumeration ⋮ Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization ⋮ The perfect matching cut problem revisited ⋮ The perfect matching cut problem revisited ⋮ Matching cut in graphs with large minimum degree ⋮ On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs ⋮ An FPT algorithm for matching cut and d-cut
This page was built for publication: On structural parameterizations of the matching cut problem
