Description: DIMACS10 set: star-mixtures/vsp_data_and_seymourl
|(undirected graph drawing)|
|number of rows||9,167|
|number of columns||9,167|
|# strongly connected comp.||1|
|explicit zero entries||0|
|nonzero pattern symmetry||symmetric|
|numeric value symmetry||symmetric|
|kind||random unweighted graph|
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.
|null space dimension||35|
|full numerical rank?||no|
|singular value gap||1.8059e+10|
|singular values (MAT file):||click here|
|SVD method used:||s = svd (full (A))|
For a description of the statistics displayed above, click here.
Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.