Login / Signup
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.
Loukas Georgiadis
Giuseppe F. Italiano
Charis Papadopoulos
Nikos Parotsidis
Published in:
CoRR (2015)
Keyphrases
</>
directed graph
strongly connected
disjoint paths
edge weights
undirected graph
graph properties
random walk
connected components
weighted graph
edge information
np hard
edge detection
graph structure
directed acyclic graph
maximum flow
special case