Login / Signup
Fast Approximations for Rooted Connectivity in Weighted Directed Graphs.
Kent Quanrud
Published in:
CoRR (2021)
Keyphrases
</>
directed graph
strongly connected
random walk
directed acyclic graph
maximum flow
edge weights
disjoint paths
graph structures
web graph
undirected graph
data sets
connected components
approximation methods
graph structure
network connectivity
closed form
rough sets