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

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

Additional fields	size and type
nodename	full 38-by-40
coord	full 38-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'))	89	94
Cholesky flop count	2.3e+02	2.7e+02
nnz(L+U), no partial pivoting	140	150
nnz(V) for QR, upper bound nnz(L) for LU	51	44
nnz(R) for QR, upper bound nnz(U) for LU	144	144

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.