Matrix: Pajek/GD00_c
Description: Pajek network: Graph Drawing contest 2000
| Matrix properties | |
| number of rows | 638 |
| number of columns | 638 |
| nonzeros | 1,041 |
| structural full rank? | no |
| structural rank | 302 |
| # of blocks from dmperm | 138 |
| # strongly connected comp. | 566 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 2% |
| numeric value symmetry | 2% |
| type | integer |
| structure | unsymmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | Graph Drawing Contest |
| editor | V. Batagelj |
| date | 2000 |
| kind | directed multigraph |
| 2D/3D problem? | no |
| Additional fields | size and type |
| nodename | full 638-by-76 |
| coord | full 638-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')) | 2,286 | 2,487 |
| Cholesky flop count | 1.4e+04 | 1.8e+04 |
| nnz(L+U), no partial pivoting | 3,934 | 4,336 |
| nnz(V) for QR, upper bound nnz(L) for LU | 6,666 | 4,835 |
| nnz(R) for QR, upper bound nnz(U) for LU | 6,031 | 6,624 |
Maintained by Tim Davis, last updated 30-Sep-2008.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.