2 papers
cs.DS2025
The Minimum Subgraph Complementation Problem
Juan Gutiérrez, Sagartanu Pal
Subgraph complementation is an operation that toggles all adjacencies inside a selected vertex set. Given a graph \(G\) and a target class \(\mathcal{C}\), the Minimum Subgraph Com…
cs.DS2024
Switching Classes: Characterization and Computation
Dhanyamol Antony, Yixin Cao, Sagartanu Pal +1
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class , we are concerned with the maximum…