Matrix: DIMACS10/vsp_mod2_pgp2_slptsk
Description: DIMACS10 set: star-mixtures/vsp_mod2_pgp2_slptsk
(undirected graph drawing) |
Matrix properties | |
number of rows | 101,364 |
number of columns | 101,364 |
nonzeros | 778,736 |
# strongly connected comp. | 2 |
explicit zero entries | 0 |
nonzero pattern symmetry | symmetric |
numeric value symmetry | symmetric |
type | binary |
structure | symmetric |
Cholesky candidate? | no |
positive definite? | no |
author | C. Schultz |
editor | H. Meyerhenke |
date | 2011 |
kind | random unweighted graph |
2D/3D problem? | no |
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.
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.