Laboratory for Web Algorithmics (LAW), Universita degli Studi di Milano, 
http://law.di.unimi.it/index.php.  When using matrices in the LAW/ group 
in the collection, please follow the citation instructions at            
http://law.di.unimi.it/datasets.php.  If you publish results based on    
these graphs, please acknowledge the usage of WebGraph and LLP by quoting
the following papers:                                                    
                                                                         
[1] "The WebGraph Framework I: Compression Techniques," Paolo Boldi      
    and Sebastiano Vigna, Proc. of the Thirteenth International          
    World Wide Web Conference (WWW 2004), 2004, Manhattan, USA,          
    pp. 595--601, ACM Press.                                             
                                                                         
[2] "Layered Label Propagation: A MultiResolution Coordinate-Free        
    Ordering for Compressing Social Networks," Paolo Boldi, Marco        
    Rosa, Massimo Santini, and Sebastiano Vigna, Proceedings of the      
    20th international conference on World Wide Web, 2011, ACM Press.    
                                                                         
If the graphs you are using were gathered by UbiCrawler, please          
acknowledge the usage of UbiCrawler by quoting the following paper:      
                                                                         
[3] "UbiCrawler: A Scalable Fully Distributed Web Crawler",              
    Paolo Boldi, Bruno Codenotti, Massimo Santini, and Sebastiano        
    Vigna, Software: Practice & Experience, 2004, vol 34, no. 8,         
    pp. 711--726                                                         
                                                                         
LAW/dblp-2010                                                            
                                                                         
DBLP is a bibliography service from which an undirected scientific       
collaboration network can be extracted: each vertex represents a         
scientist and two vertices are connected if they have worked together    
on an article. This symmetric graph has been obtained in June 2010       
from the standard DBLP download (http://dblp.uni-trier.de/xml/).         
                                                                         
For additional graph properties and statistics, including node labels,   
see http://law.di.unimi.it/webdata/dblp-2010