5 citations · 15 across the 12 of their papers we have counts for
Showing 2022 · cs.DSShow all
2 papers · 2 filters
cs.DS2022★ 1 cited
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs
Giorgio Ausiello, Lorenzo Balzotti, Paolo G. Franciosa +2
The vitality of an edge in a graph with respect to the maximum flow between two fixed vertices and is defined as the reduction of the maximum flow value caused by the remov…
cs.DS2022★ 1 cited
How Vulnerable is an Undirected Planar Graph with respect to Max Flow
Lorenzo Balzotti, Paolo G. Franciosa
We study the problem of computing the vitality of edges and vertices with respect to the -max flow in undirected planar graphs, where the vitality of an edge/vertex is the …