Max-flow vitality in undirected unweighted planar graphs

Giorgio Ausiello, Paolo G. Franciosa, Isabella Lari +1

We show a fast algorithm for determining the set of edges in a planar undirected unweighted graph, whose deletion reduces the maximum flow between two fixed vertices. This is a spe…