Fetching the paper…
Reading the bibliography…
We consider the fundamental problems of determining the rooted and global edge and vertex connectivities (and computing the corresponding cuts) in directed graphs.
“Submodular functions, matroids, and certain polyhedra”
Jack Edmonds · 1970
Earlier work this paper cites.
“An Algorithm for finding the edge connectivity of graphs”
V.. Podderyugin · 1973
Earlier work this paper cites.
“Network Flow and Testing Graph Connectivity”
Shimon Even and Robert Tarjan · 1975
Earlier work this paper cites.
“Determining Edge Connectivity in O ( n m ) O(nm) ”
David. Matula · 1987
Earlier work this paper cites.
“Finding the Edge Connectivity of Directed Graphs”
Yishay Mansour and Baruch Schieber · 1989
Earlier work this paper cites.
“Directed s s – t t Numberings, Rubber Bands, and Testing Digraph k k -Vertex Connectivity”
Joseph Cheriyan and John. Reif · 1994
Earlier work this paper cites.
“A Faster Algorithm for Finding the Minimum Cut in a Directed Graph”
Jianxiu Hao and James. Orlin · 1994
Earlier work this paper cites.
“A Matroid Approach to Finding Edge Connectivity and Packing Arborescences”
Harold. Gabow · 1995
Earlier work this paper cites.
“Beyond the Flow Decomposition Barrier”
Andrew. Goldberg and Satish Rao · 1998
Earlier work this paper cites.
“Computing Vertex Connectivity: New Bounds from Old Techniques”
Monika Henzinger, Satish Rao and Harold. Gabow · 2000
Earlier work this paper cites.
“Combinatorial Optimization - Polyhedra and Efficiency”
Alexander Schrijver · 2003
Cited alongside, same era.
“Using expander graphs to find vertex connectivity”
Harold. Gabow · 2006
Cited alongside, same era.
“Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs”
Jan van Brand et al · 2009
Cited alongside, same era.
“Connections in Combinatorial Optimization”
András Frank · 2011
Cited alongside, same era.
“Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back”
Aleksander Madry · 2013
Cited alongside, same era.
“Max flows in O ( m n ) O(mn) time, or better”
James. Orlin · 2013
Cited alongside, same era.
“Unit Capacity Maxflow in Almost O ( m 4 / 3 ) O(m^{4/3}) Time”
Tarun Kathuria, Yang. Liu and Aaron Sidford · 2020
Later among the works it cites.
In IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020
Jason Li and Debmalya Panigrahi · 2020
Later among the works it cites.
“Faster energy maximization for faster maximum flow”
Yang. Liu and Aaron Sidford · 2020
Later among the works it cites.
“A Refined Laser Method and Faster Matrix Multiplication”
Josh Alman and Virginia Williams · 2021
Closest in time.
“Minimum Cost Flows, MDPs, and ℓ 1 \ell_{1} -Regression in Nearly Linear Time for Dense Instances”
Jan van Brand et al · 2021
Closest in time.
“Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Path Finding Methods for Linear Programming: Solving Linear Programs in O ~ ( rank ) \tilde{O}(\sqrt{\text{rank}}) Iterations and Faster Algorithms for Maximum Flow”
Yin Lee and Aaron Sidford · 2014
Cited alongside, same era.
“Computing Maximum Flow with Augmenting Electrical Flows”
Aleksander Madry · 2016
Cited alongside, same era.
“Breaking quadratic time for small vertex connectivity and an approximation scheme”
Danupon Nanongkai, Thatchaphol Saranurak and Sorrachai Yingchareonthawornchai · 2019
Cited alongside, same era.
“Breaking quadratic time for small vertex connectivity and an approximation scheme”
Danupon Nanongkai, Thatchaphol Saranurak and Sorrachai Yingchareonthawornchai · 2019
Cited alongside, same era.
Yu Gao, Yang. Liu and Richard Peng · 2021
Closest in time.
“Vertex Connectivity in Poly-logarithmic Max-flows”, 2021
Jason Li et al · 2021
Closest in time.
“Fast approximations for rooted connectivity in weighted directed graphs” Forthcoming, 2021
Kent Quanrud · 2021
Closest in time.
“Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms”
Sebastian Forster et al · 2065
Closest in time.