5 citations · 15 across the 12 of their papers we have counts for
8 papers · 1 filter
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…
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 …
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
Lorenzo Balzotti, Paolo G. Franciosa
Given a set of well-formed terminal pairs on the external face of an undirected planar graph with unit edge weights, we give a linear-time algorithm for computing the union of non-…
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.…
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…
Max flow vitality in general and -planar graphs
Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari +1
The \emph{vitality} of an arc/node of a graph with respect to the maximum flow between two fixed nodes and is defined as the reduction of the maximum flow caused by the rem…
Incremental DFS Trees on Arbitrary Directed Graphs
Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano +1
We present a new algorithm for maintaining a DFS tree of an arbitrary directed graph under any sequence of edge insertions. Our algorithm requires a total of time in…
On Resilient Graph Spanners
G. Ausiello, P. G. Franciosa, G. F. Italiano +1
We introduce and investigate a new notion of resilience in graph spanners. Let be a spanner of a graph . Roughly speaking, we say that a spanner is resilient if all its…