Engineering a Combinatorial Laplacian Solver: Lessons Learned

Engineering a Combinatorial Laplacian Solver: Lessons Learned

Linear system solving is a main workhorse in applied mathematics. Recently, theoretical computer scientists contributed sophisticated algorithms for solving linear systems with symmetric diagonally-dominant (SDD) matrices in provably nearly-linear time. These algorithms are very interesting from a t...

Full description

Bibliographic Details
Main Authors: Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke, Michael Wegner
Format: Article
Language:English
Published: MDPI AG 2016-10-01
Series:Algorithms
Subjects:
Laplacian linear systems
graph algorithms
low-stretch spanning trees
electrical graph flows
algorithm engineering
Online Access:http://www.mdpi.com/1999-4893/9/4/72

Internet

http://www.mdpi.com/1999-4893/9/4/72

Similar Items