Faster Parameterized Algorithms for Deletion to Split Graphs

DOI10.1007/978-3-642-31155-0_10zbMath1357.68083OpenAlexW1505397334MaRDI QIDQ2904547

Sudeshna Kolay, Ashutosh Rai, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Esha Ghosh, M. S. Ramanujan

Publication date: 14 August 2012

Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31155-0_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Deleting edges to restrict the size of an epidemic: a new application for treewidth ⋮ Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth ⋮ Polynomial kernelization for removing induced claws and diamonds ⋮ Obtaining split graphs by edge contraction ⋮ Polynomial Kernelization for Removing Induced Claws and Diamonds

This page was built for publication: Faster Parameterized Algorithms for Deletion to Split Graphs