39 citations · 78 across the 27 of their papers we have counts for
Showing 2015 · cs.DSShow all
2 papers · 2 filters
cs.DS2015★ 1 cited
Strong Connectivity in Directed Graphs under Failures, with Application
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
In this paper, we investigate some basic connectivity problems in directed graphs (digraphs). Let be a digraph with edges and vertices, and let be the di…
cs.DS2015★ 3 cited
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos +1
Let be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of that mai…