Koustav Bhanja

activity

20232026

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Optimal Sensitivity Oracle for Steiner Mincut

Koustav Bhanja

Let $G = (V, E)$ be an undirected weighted graph on $n = ∣ V ∣$ vertices and $S \subseteq V$ be a Steiner set. Steiner mincut is a well-studied concept, which provides a generalization to…

cs.DS2024

Minimum+1 Steiner Cuts and Dual Edge Sensitivity Oracle: Bridging the Gap between Global cut and (s,t)-cut

Koustav Bhanja

Let $G = (V, E)$ be an undirected multi-graph on $n = ∣ V ∣$ vertices and $S \subseteq V$ be a Steiner set. Steiner cut is a fundamental concept; moreover, global cut $(∣ S ∣ = n)$ , as well as…