Lorenzo Balzotti

activity

20192022

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

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

collaborators

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2022

Two New Characterizations of Path Graphs

Nicola Apollonio, Lorenzo Balzotti

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths i…