5 citations · 9 across the 6 of their papers we have counts for
7 papers
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…
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…
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program
Francesco Lupia, Angelo Mendicelli, Andrea Ribichini +2
In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved. When…
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…
Reactive Imperative Programming with Dataflow Constraints
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes of their environm…