Matrix properties
number of rows	311
number of columns	311
nonzeros	645
structural full rank?	no
structural rank	158
# of blocks from dmperm	61
# strongly connected comp.	303
explicit zero entries	0
nonzero pattern symmetry	2%
numeric value symmetry	2%
type	integer
structure	unsymmetric
Cholesky candidate?	no
positive definite?	no

author	Graph Drawing Contest
editor	V. Batagelj
date	2001
kind	directed weighted graph
2D/3D problem?	no

Additional fields	size and type
nodename	full 311-by-38
coord	full 311-by-2

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/.                                
------------------------------------------------------------------------------
The original problem had 3D xyz coordinates, but all values of z were equal   
to 0.5, and have been removed.  This graph has 2D coordinates.                

Ordering statistics:	AMD	METIS
nnz(chol(P*(A+A'+s*I)*P'))	2,261	2,491
Cholesky flop count	4.1e+04	5.0e+04
nnz(L+U), no partial pivoting	4,211	4,671
nnz(V) for QR, upper bound nnz(L) for LU	2,050	1,907
nnz(R) for QR, upper bound nnz(U) for LU	2,186	2,263

Maintained by Tim Davis, last updated 04-May-2008.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.