3 papers
cs.DS2026
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,…
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.DS2024
Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
Surender Baswana, Koustav Bhanja
Let G be a directed weighted graph (DiGraph) on n vertices and m edges with source s and sink t. An edge in G is vital if its removal reduces the capacity of (s,t)-mincut. Since th…