Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.62, Iss.3, 2001-05, pp. : 398-412

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

Abstract

Related content

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

By Lingas Andrzej

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 36-50

Springer Publishing Company

Access to resources Recommend Favorite

Efficient massively parallel implementation of some combinatorial algorithms

By Tsan-sheng H. Ramachandran V.

Theoretical Computer Science, Vol. 162, Iss. 2, 1996-08 ,pp. : 297-322

Elsevier

Access to resources Recommend Favorite

Differential approximation algorithms for some combinatorial optimization problems

By Demange M. Grisoni P. Th. Paschos V.

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 107-122

Elsevier

Access to resources Recommend Favorite

Optimal Parallel Algorithms for Computer Vision Problems

By Wu C-H. Horng S-J. Tsai H-R.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 6, 2002-06 ,pp. : 1021-1041

Academic Press

Access to resources Recommend Favorite

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

By Nikolopoulos S.D.

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 48-67

Elsevier

Access to resources Recommend Favorite