5 citations · 15 across the 12 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Computing Lengths of Non-Crossing Shortest Paths in Planar Graphs
Lorenzo Balzotti, Paolo G. Franciosa
Given a plane undirected graph with non-negative edge weights and a set of terminal pairs on the external face, it is shown in Takahashi et al. (Algorithmica, 16, 1996, pp.…
cs.DS2020★ 2 cited
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…