Algorithms for subgraph complementation to some classes of graphs

DOI10.1016/j.ipl.2024.106530MaRDI QIDQ6663515

R. B. Sandeep, Dhanyamol Antony, Sagartanu Pal

Publication date: 14 January 2025

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

minimum degreediamondkernelizationstar graphssubgraph complementation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Recent developments on graphs of bounded clique-width
• Generalized split graphs and Ramsey numbers
• On subgraph complementation to \(H\)-free Graphs
• Subgraph complementation
• Polynomial kernelization for removing induced claws and diamonds
• Parameterized Algorithms
• A survey of parameterized algorithms and the complexity of edge modification
• Cutting a tree with subgraph complementation is hard, except for some small trees
• Proceedings of the 64th annual IEEE symposium on foundations of computer science, FOCS 2023, Santa Cruz, CA, USA, November 6--9, 2023

This page was built for publication: Algorithms for subgraph complementation to some classes of graphs