Matrix properties
number of rows	3,774,768
number of columns	3,774,768
nonzeros	14,970,767
# strongly connected comp.	3,774,768
explicit zero entries	0
nonzero pattern symmetry	0%
numeric value symmetry	0%
type	binary
structure	unsymmetric
Cholesky candidate?	no
positive definite?	no

author	B. Hall, A. Jaffe, M. Tratjenberg
editor	V. Batagelj
date	2001
kind	directed graph
2D/3D problem?	no

Additional fields	size and type
appyear	full 3774768-by-1
cat	full 3774768-by-1
class	full 3774768-by-1
date	full 3774768-by-1
subcat	full 3774768-by-1
year	full 3774768-by-1
country	full 3774768-by-4
nodename	full 3774768-by-7

Notes:

------------------------------------------------------------------------------
Pajek network converted to sparse adjacency matrix for inclusion in UF sparse 
matrix collection, Tim Davis.  For Pajek datasets, See V. Batagelj & A. Mrvar,
http://vlado.fmf.uni-lj.si/pub/networks/data/.                                
------------------------------------------------------------------------------
Regarding conversion for UF sparse matrix collection: in the original data    
there are 14,973,817 edges (unweighted).  Of this, 3050 are duplicates        
This graph is binary; the duplicates have been removed.                       
Also, the original data has auxiliary data for all 6,009,554 US Patents in the
time period.  This patent network has only 3,774,768 patents, and the auxiliar
data (appyear, class, etc.) is matched here to the nodes of the graph.        
------------------------------------------------------------------------------

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.