暂无分享,去创建一个
Debmalya Panigrahi | Thatchaphol Saranurak | Jason Li | Debmalya Panigrahi | Jason Li | Thatchaphol Saranurak
[1] Aaron Sidford,et al. Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[2] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[3] David R. Karger,et al. Fast Augmenting Paths by Random Sampling from Residual Graphs , 2015, SIAM J. Comput..
[4] Glencora Borradaile,et al. Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[5] Kent Quanrud,et al. Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems , 2021, ICALP.
[6] Robert Krauthgamer,et al. Cut-Equivalent Trees are Optimal for Min-Cut Queries , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[7] Debmalya Panigrahi,et al. Deterministic Min-cut in Poly-logarithmic Max-flows , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[8] Robert Krauthgamer,et al. Subcubic algorithms for Gomory–Hu tree in unweighted graphs , 2020, STOC.
[9] Dan Gusfield,et al. Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..
[10] Debmalya Panigrahi,et al. Efficient algorithms for computing all low s-t edge connectivities and related problems , 2007, SODA '07.
[11] Thatchaphol Saranurak,et al. Deterministic Weighted Expander Decomposition in Almost-linear Time , 2021, ArXiv.
[12] Robert Krauthgamer,et al. New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs , 2019, SODA.
[13] Yin Tat Lee,et al. Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances , 2021, STOC.
[14] Christos D. Zaroliagis,et al. All-Pairs Min-Cut in Sparse Networks , 1995, J. Algorithms.
[15] David Eppstein,et al. All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs , 2016, Symposium on Computational Geometry.
[16] Debmalya Panigrahi,et al. Approximate Gomory–Hu tree is faster than n – 1 max-flows , 2021, STOC.
[17] Debmalya Panigrahi,et al. An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs , 2007, STOC '07.
[18] Richard Peng,et al. A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).