Login / Signup
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.
Shiri Chechik
Thomas Dueholm Hansen
Giuseppe F. Italiano
Veronika Loitzenbauer
Nikos Parotsidis
Published in:
CoRR (2017)
Keyphrases
</>
directed graph
random walk
connected subgraphs
graph theory
learning algorithm
data structure
data streams
high dimensional
computational model
high throughput
maximum flow
strongly connected