Login / Signup

Minimum Cuts in Directed Graphs via Partial Sparsification.

Ruoxu CenJason LiDanupon NanongkaiDebmalya PanigrahiThatchaphol SaranurakKent Quanrud
Published in: FOCS (2022)
Keyphrases
  • directed graph
  • random walk
  • undirected graph
  • directed acyclic graph
  • strongly connected
  • least squares
  • maximum flow
  • square error
  • graph structure
  • min cut
  • disjoint paths