Matrix properties
number of rows	36
number of columns	36
nonzeros	57
structural full rank?	no
structural rank	32
# of blocks from dmperm	23
# strongly connected comp.	4
explicit zero entries	0
nonzero pattern symmetry	4%
numeric value symmetry	4%
type	binary
structure	unsymmetric
Cholesky candidate?	no
positive definite?	no

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

Additional fields	size and type
nodename	full 36-by-31
coord	full 36-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, and have been removed.  This graph has 2D coordinates.                  

Ordering statistics:	AMD	METIS
nnz(chol(P*(A+A'+s*I)*P'))	118	138
Cholesky flop count	4.1e+02	6.0e+02
nnz(L+U), no partial pivoting	200	240
nnz(V) for QR, upper bound nnz(L) for LU	47	49
nnz(R) for QR, upper bound nnz(U) for LU	69	70

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