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

author	L. Krempel
editor	V. Batagelj
date	1998
kind	directed weighted graph
2D/3D problem?	no

Additional fields	size and type
nodename	full 35-by-3
coord	full 35-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'))	200	208
Cholesky flop count	1.4e+03	1.5e+03
nnz(L+U), no partial pivoting	365	381
nnz(V) for QR, upper bound nnz(L) for LU	112	131
nnz(R) for QR, upper bound nnz(U) for LU	146	151

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.