Minimum Cuts in Directed Graphs via √n Max-Flows.

Ruoxu Cen Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak

Published in: CoRR (2021)

Keyphrases

directed graph
random walk
undirected graph
directed acyclic graph
strongly connected
graph structure
maximum flow
web graph
information retrieval
probabilistic model
information extraction
relational data
minimum cost
spanning tree
transition matrix