15 citations · 26 across the 17 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…
On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications
Loukas Georgiadis, Aikaterini Karanasiou, Giannis Konstantinos +1
A flow graph is a directed graph with a distinguished start vertex . The dominator tree of is a tree rooted at , such that a vertex is an ancestor of…
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…
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…