Login / Signup

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.

Shiri ChechikThomas Dueholm HansenGiuseppe F. ItalianoVeronika LoitzenbauerNikos Parotsidis
Published in: SODA (2017)
Keyphrases
  • directed graph
  • data structure
  • maximum flow
  • connected subgraphs
  • directed acyclic graph
  • strongly connected
  • data sets
  • supervised learning
  • gray scale