Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
109
click to vote
CORR
2010
Springer
98
views
Education
»
more
CORR 2010
»
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
15 years 3 months ago
Download
math.mit.edu
We 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 probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
claim paper
Read More »