The Consecutive Ones Submatrix Problem for Sparse Matrices

ISSN： 0178-4617

Source： Algorithmica, Vol.48, Iss.3, 2007-07, pp. : 287-299

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Approaches Based on Permutations for Partitioning Sparse Matrices on Multiprocessors

By Garz E. GarcÍa I.

The Journal of Supercomputing, Vol. 34, Iss. 1, 2005-10 ,pp. : 41-61

Springer Publishing Company

Access to resources Recommend Favorite

Hybrid Sparse Resultant Matrices for Bivariate Polynomials

By D’Andrea C. Emiris I.Z.

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 587-608

Academic Press

Access to resources Recommend Favorite

Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms

By Lin Wen-Yang

Applied Intelligence, Vol. 23, Iss. 3, 2005-12 ,pp. : 257-265

Springer Publishing Company

Access to resources Recommend Favorite

Parallel iterative solvers for irregular sparse matrices in High Performance Fortran

By de Sturler E. Loher D.

Future Generation Computer Systems, Vol. 13, Iss. 4, 1998-03 ,pp. : 315-325

Elsevier

Access to resources Recommend Favorite

A fully parallel block independent set algorithm for distributed sparse matrices

By Shen C. Zhang J.

Parallel Computing, Vol. 29, Iss. 11, 2003-11 ,pp. : 1685-1699

Elsevier

Access to resources Recommend Favorite