Matrix properties
number of rows	86
number of columns	86
nonzeros	248
structural full rank?	no
structural rank	72
# of blocks from dmperm	41
# strongly connected comp.	1
explicit zero entries	0
nonzero pattern symmetry	symmetric
numeric value symmetry	symmetric
type	integer
structure	symmetric
Cholesky candidate?	yes
positive definite?	no

author	I. Klavzar
editor	V. Batagelj
date	1999
kind	undirected weighted graph
2D/3D problem?	no

Additional fields	size and type
nodename	full 86-by-16
coord	full 86-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'))	221	231
Cholesky flop count	6.2e+02	6.8e+02
nnz(L+U), no partial pivoting	356	376
nnz(V) for QR, upper bound nnz(L) for LU	289	224
nnz(R) for QR, upper bound nnz(U) for LU	533	563

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.