Matrix properties
number of rows	314
number of columns	360
nonzeros	613
structural full rank?	no
structural rank	246
# of blocks from dmperm	122
# strongly connected comp.	129
explicit zero entries	0
nonzero pattern symmetry	0%
numeric value symmetry	0%
type	binary
structure	rectangular
Cholesky candidate?	no
positive definite?	no

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

Additional fields	size and type
colname	full 360-by-8
rowname	full 314-by-24
coord	full 674-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.                

SVD-based statistics:
norm(A)	5.72862
min(svd(A))	3.89787e-17
cond(A)	1.46968e+17
rank(A)	239
sprank(A)-rank(A)	7
null space dimension	75
full numerical rank?	no
singular value gap	2.45259e+14

singular values (MAT file):	click here
SVD method used:	s = svd (full (A)) ;
status:	ok

For a description of the statistics displayed above, click here.

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