Search Results - "Pal, Sagartanu"

On Subgraph Complementation to H-free Graphs by Antony, Dhanyamol, Garchar, Jay, Pal, Sagartanu, Sandeep, R. B., Sen, Sagnik, Subashini, R.

“…For a class G of graphs, the problem Subgraph Complement to G asks whether one can find a subset S of vertices of the input graph G such that complementing the…”
Get full text

Algorithms for subgraph complementation to some classes of graphs by Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R.B.

“…For a class G of graphs, the objective of Subgraph Complementation toG is to find whether there exists a subset S of vertices of the input graph G such that…”
Get full text

Cutting a tree with subgraph complementation is hard, except for some small trees by Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B., Subashini, R.

“…For a graph property Π ${\rm{\Pi }}$, Subgraph Complementation to Π ${\rm{\Pi }}$ is the problem to find whether there is a subset S $S$ of vertices of the…”
Get full text

Algorithms for subgraph complementation to some classes of graphs by Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B

“…For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of…”
Get full text

Switching Classes: Characterization and Computation by Antony, Dhanyamol, Cao, Yixin, Pal, Sagartanu, Sandeep, R. B

“…In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are…”
Get full text

Cutting a tree with Subgraph Complementation is hard, except for some small trees by Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B, Subashini, R

“…For a graph property $\Pi$, Subgraph Complementation to $\Pi$ is the problem to find whether there is a subset $S$ of vertices of the input graph $G$ such that…”
Get full text

On subgraph complementation to H-free graphs by Antony, Dhanyamol, Garchar, Jay, Pal, Sagartanu, Sandeep, R. B, Sen, Sagnik, Subashini, R

“…For a class $\mathcal{G}$ of graphs, the problem SUBGRAPH COMPLEMENT TO $\mathcal{G}$ asks whether one can find a subset $S$ of vertices of the input graph $G$…”
Get full text