{
    matrix_id: '2637',
    name: 'vsp_c-60_data_cti_cs4',
    group: 'DIMACS10',
    description: 'DIMACS10 set: star-mixtures/vsp_c-60_data_cti_cs4',
    author: 'C. Schultz',
    editor: 'H. Meyerhenke',
    date: '2011',
    kind: 'random unweighted graph',
    problem_2D_or_3D: '0',
    num_rows: '85830',
    num_cols: '85830',
    nonzeros: '482160',
    num_explicit_zeros: '0',
    num_strongly_connected_components: '4',
    pattern_symmetry: '1.000',
    numeric_symmetry: '1.000',
    rb_type: 'binary',
    structure: 'symmetric',
    cholesky_candidate: 'no',
    positive_definite: '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.                
',
    image_files: 'vsp_c-60_data_cti_cs4.png,vsp_c-60_data_cti_cs4_scc.png,vsp_c-60_data_cti_cs4_graph.gif,',
}
