On structural parameterizations of the matching cut problem

DOI10.1007/978-3-319-71147-8_34zbMath1472.68071MaRDI 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

zbMATH Keywords

parameterized algorithm; decomposable graphs; matching cut

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization