Laplacians
Short algorithm, long-range consequences
March 1, 2013
A new technique for solving ‘graph Laplacians’ is drastically simpler than its predecessors, with implications for a huge range of practical problems.
Also labeled: Algorithms, Graph theory, Linear algebra, Graph Laplacian, Mathematics, Theoretical computer science
First improvement of fundamental algorithm in 10 years
September 27, 2010
The max-flow problem, which is ubiquitous in network analysis, scheduling, and logistics, can now be solved more efficiently than ever.
Subscribe
