3 code implementations • 23 Apr 2020 • Wolfgang Ost, Christian Schulz, Darren Strash
Many applications rely on time-intensive matrix operations, such as factorization, which can be sped up significantly for large sparse matrices by interpreting the matrix as a sparse graph and computing a node ordering that minimizes the so-called fill-in.
Data Structures and Algorithms Combinatorics
