Matrix properties
number of rows	80
number of columns	80
nonzeros	232
structural full rank?	no
structural rank	77
# of blocks from dmperm	35
# strongly connected comp.	11
explicit zero entries	0
nonzero pattern symmetry	0%
numeric value symmetry	0%
type	binary
structure	unsymmetric
Cholesky candidate?	no
positive definite?	no

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

Additional fields	size and type
nodename	full 80-by-4
coord	full 80-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'))	496	537
Cholesky flop count	3.3e+03	3.9e+03
nnz(L+U), no partial pivoting	912	994
nnz(V) for QR, upper bound nnz(L) for LU	219	228
nnz(R) for QR, upper bound nnz(U) for LU	492	542

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.