Lorenzo Balzotti

most citedA Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs

1 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2022★ 1 cited

Non-Crossing Shortest Paths are Covered with Exactly Four Forests

Lorenzo Balzotti

Given a set of paths $P$ we define the \emph{Path Covering with Forest Number} of $P$ } (PCFN( $P$ )) as the minimum size of a set $F$ of forests satisfying that every path in $P$ is…

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 $s$ and $t$ is defined as the reduction of the maximum flow value caused by the remov…