Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs

Mridul Ahi, Keerti Choudhary, Shlok Pande +2

Given a digraph $G=(V,E)$ with a designated source $s$, sink $t$, and an $(s,t)$-max-flow of value $\hat{I}»$, we present constructions for max-flow and min-cut sensitivity oracles, a…