2-Edge Connectivity in Directed Graphs.

Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis

Published in: CoRR (2014)

Keyphrases

directed graph
strongly connected
disjoint paths
undirected graph
random walk
maximum flow
edge weights
graph structure
directed acyclic graph
approximation algorithms
web graph
dynamic programming
connected components
weighted graph
multiple scales
clustering method
special case
directed edges