7 citations · 34 across the 29 of their papers we have counts for
4 papers · 1 filter
All-Pairs 2-Reachability in Time
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano +2
In the -reachability problem we are given a directed graph and we wish to determine if there are two (edge or vertex) disjoint paths from to , for a given pair of ver…
Incremental -Edge-Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
In this paper, we initiate the study of the dynamic maintenance of -edge-connectivity relationships in directed graphs. We present an algorithm that can update the -edge-conn…
Design of Dynamic Algorithms via Primal-Dual Method
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain a…
An Experimental Study of Dynamic Dominators
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura +1
Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and de…