5 papers
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…
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…
Algorithms for subgraph complementation to some classes of graphs
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep
For a class of graphs, the objective of \textsc{Subgraph Complementation to} is to find whether there exists a subset of vertices of the input graph…
Cutting a tree with Subgraph Complementation is hard, except for some small trees
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep +1
For a graph property , Subgraph Complementation to is the problem to find whether there is a subset of vertices of the input graph such that modifying by complem…
On subgraph complementation to H-free graphs
Dhanyamol Antony, Jay Garchar, Sagartanu Pal +3
For a class of graphs, the problem SUBGRAPH COMPLEMENT TO asks whether one can find a subset of vertices of the input graph such that complement…