Random sampling in residual graphs

DOI10.1145/509907.509918zbMath1192.90230OpenAlexW2149841335MaRDI QIDQ3579176

Matthew S. Levine, David R. Karger

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509918

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

On computing minimum\((s,t)\)-cuts in digraphs ⋮ Maximum bipartite flow in networks with adaptive channel width ⋮ Weighted random sampling with a reservoir ⋮ Fast Augmenting Paths by Random Sampling from Residual Graphs ⋮ Sparsification of Two-Variable Valued Constraint Satisfaction Problems

This page was built for publication: Random sampling in residual graphs