Matrix properties
number of rows	55
number of columns	46
nonzeros	1,342
structural full rank?	yes
structural rank	46
# of blocks from dmperm	1
# strongly connected comp.	1
explicit zero entries	0
nonzero pattern symmetry	0%
numeric value symmetry	0%
type	integer
structure	rectangular
Cholesky candidate?	no
positive definite?	no

author	P. Taylor, D. Walker
editor	V. Batagelj
date	2001
kind	weighted bipartite graph
2D/3D problem?	no

Additional fields	size and type
cluster	full 101-by-1
colname	full 46-by-45
rowname	full 55-by-13

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/.                                
------------------------------------------------------------------------------
 http://www.lboro.ac.uk/gawc/datasets/da6.html                                
 Accountancy                                                                  
 Advertising                                                                  
 Banking and Finance                                                          
 Law                                                                          

SVD-based statistics:
norm(A)	56.0866
min(svd(A))	0.270755
cond(A)	207.149
rank(A)	46
sprank(A)-rank(A)	0
null space dimension	0
full numerical rank?	yes

singular values (MAT file):	click here
SVD method used:	s = svd (full (R)) ; where [~,R,E] = spqr (A) with droptol of zero
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.