Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleOctober 2013
Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 253–262https://doi.org/10.1109/FOCS.2013.35We present an m(10/7)= (m1.43-time We recall that f denotes O(f poly(log f)). algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is the first improvement over the sparse-graph case of the ...
- research-articleJune 2011
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computingJune 2011, Pages 273–282https://doi.org/10.1145/1993636.1993674We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a system of linear ...
- ArticleOctober 2009
Faster Generation of Random Spanning Trees
FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer ScienceOctober 2009, Pages 13–21In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected time $\TO(m\sqrt{...