9 citations · 15 across the 21 of their papers we have counts for
Showing 2023 · cs.DSShow all
2 papers · 2 filters
cs.DS2023
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…
cs.DS2023
Contracting edges to destroy a pattern: A complexity study
Dipayan Chakraborty, R. B. Sandeep
Given a graph G and an integer k, the objective of the -Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a gr…