The SuiteSparse Matrix Collection (formerly the University of Florida Sparse Matrix Collection) is a widely used set of sparse matrix benchmarks collected from a wide range of applications. See the about page for more information.
≤ Number of Rows ≤
≤ Number of Columns ≤
≤ Number of Nonzeros ≤
≤ Pattern Symmetry ≤
≤ Numerical Symmetry ≤
≤ Number of Strongly Connected Components ≤
Displaying matrices 1 - 20 of 2757 in total
Id Name Group Rows ⬆ Cols Nonzeros Kind Date
2137 Trec3 JGD_Kocay 1 2 1 Combinatorial Problem 2008
1983 GL7d10 JGD_GL7d 1 60 8 Combinatorial Problem 2008
2138 Trec4 JGD_Kocay 2 3 3 Combinatorial Problem 2008
2139 Trec5 JGD_Kocay 3 7 12 Combinatorial Problem 2008
904 cage3 vanHeukelum 5 5 19 Directed Weighted Graph 2003
2088 n3c4-b4 JGD_Homology 6 15 30 Combinatorial Problem 2008
2140 Trec6 JGD_Kocay 6 15 40 Combinatorial Problem 2008
2009 ch3-3-b2 JGD_Homology 6 18 18 Combinatorial Problem 2008
1710 farm Meszaros 7 17 41 Linear Programming Problem 2004
449 b1_ss Grund 7 7 15 Chemical Process Simulation Problem 1997
1817 kleemin Meszaros 8 16 44 Linear Programming Problem Sequence 2004
715 lpi_galenet LPnetlib 8 14 22 Linear Programming Problem
905 cage4 vanHeukelum 9 9 49 Directed Weighted Graph 2003
185 jgl009 HB 9 9 50 Counter Example Problem 1983
719 lpi_itest2 LPnetlib 9 13 26 Linear Programming Problem 1991
2109 n4c5-b11 JGD_Homology 10 120 120 Combinatorial Problem 2008
238 rgg010 HB 10 10 76 Counter Example Problem 1983
1524 Stranke94 Pajek 10 10 90 Undirected Weighted Graph 1994
2141 Trec7 JGD_Kocay 11 36 147 Combinatorial Problem 2008
186 jgl011 HB 11 11 76 Counter Example Problem 1983