Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii

Thomas Depian, Frank Sommer

For a fixed graph class $\Pi$, the goal of $\Pi$-Modification is to transform an input graph $G$ into a graph $H\in \Pi$ using at most $k$ modifications. Vertex and edge deletions are com…