Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
From MaRDI portal
Publication:4608638
DOI10.4230/LIPIcs.MFCS.2016.75zbMath1398.68248arXiv1512.04200OpenAlexW2964082660MaRDI QIDQ4608638
Sudeshna Kolay, Saket Saurabh, Fahad Panolan, Venkatesh Raman
Publication date: 21 March 2018
Full work available at URL: https://arxiv.org/abs/1512.04200
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
On the complexity of coloring ‐graphs ⋮ On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs ⋮ Unnamed Item ⋮ Edge bipartization faster than \(2^k\) ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around ⋮ Partitions and well-coveredness: the graph sandwich problem
This page was built for publication: Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
