Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1010.2921/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTElectrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs — HN submissionhttps://news.ycombinator.com/item?id=1793869urn:hackerpapers:submission:1010.2921:1793869Fri, 15 Oct 2010 06:56:01 GMT<p>A Faster Approximation of Maximum Flow in Undirected Graphs</p><p></p><p>2 points; 1 discussion reply on HN. <a href="https://hackerpaper.kaipfister.de/p/1010.2921/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS