DIMACS10/vsp_c-30_data_data
DIMACS10 set: star-mixtures/vsp_c-30_data_data
Name |
vsp_c-30_data_data |
Group |
DIMACS10 |
Matrix ID |
2636 |
Num Rows
|
11,023 |
Num Cols
|
11,023 |
Nonzeros
|
124,368 |
Pattern Entries
|
124,368 |
Kind
|
Random Unweighted Graph |
Symmetric
|
Yes |
Date
|
2011 |
Author
|
C. Schultz |
Editor
|
H. Meyerhenke |
Structural Rank |
|
Structural Rank Full |
|
Num Dmperm Blocks
|
|
Strongly Connect Components
|
1 |
Num Explicit Zeros
|
0 |
Pattern Symmetry
|
100% |
Numeric Symmetry
|
100% |
Cholesky Candidate
|
no |
Positive Definite
|
no |
Type
|
binary |
SVD Statistics |
Matrix Norm |
1.275069e+02 |
Minimum Singular Value |
1.068727e-16 |
Condition Number |
1.193072e+18
|
Rank |
11,004 |
sprank(A)-rank(A) |
|
Null Space Dimension |
19 |
Full Numerical Rank? |
no |
Download Singular Values |
MATLAB
|
Download |
MATLAB
Rutherford Boeing
Matrix Market
|
Notes |
DIMACS10 star-mixtures set
Each graph in this benchmark represents a star-like structure of
different graphs S0 , . . . , St. Graphs S1 , . . . , St are weakly
connected to the center S0 by random edges. The total number of edges
between each Si and S0 was less than 3% out of the total number of
edges in Si . The graphs are mixtures of the following structures:
social networks, finite-element graphs, VLSI chips, peer-to-peer
networks, and matrices from optimization solvers.
More info can be found in the paper I. Safro, P. Sanders, C. Schulz:
Advanced Coarsening Schemes for Graph Partitioning, SEA 2012.
Author: Christian Schulz, uploaded on March 30, 2012.
|