A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs

DOI10.1137/21M1396824zbMath1489.05134MaRDI QIDQ5071096

M. S. Ramanujan, Saket Saurabh, Fahad Panolan, Akanksha Agrawal, Lawqueen Kanesh

Publication date: 20 April 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

fixed-parameter tractability; graph modification; elimination distance

Mathematics Subject Classification ID

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)

05C07: Vertex degrees

68Q27: Parameterized complexity, tractability and kernelization