6 citations · 10 across the 3 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
Surender Baswana, Koustav Bhanja, Anupam Roy
We study (s,t)-cuts of second minimum capacity and present the following algorithmic and graph-theoretic results. 1. Vazirani and Yannakakis [ICALP 1992] designed the first algorit…
cs.DS2025
The connectivity carcass of a vertex subset in a graph: both odd and even case
Surender Baswana, Abhyuday Pandey
Let be an undirected unweighted multi-graph and be a subset of vertices. A set of edges with the least cardinality whose removal disconnects , that is,…