Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.38, Iss.1, 2006-10, pp. : 83-107

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

Work‐efficient parallel union‐find

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 30, Iss. 4, 2018-02 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

Algorithms for some graph theoretical optimization problems

By Moonen Linda

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 3, 2006-09 ,pp. : 259-261

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

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

By Myoupo J-F. Semé D.

Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. : 212-223

Academic Press

Access to resources Recommend Favorite

Main Memory-Based Algorithms for Efficient Parallel Aggregation for Temporal Databases

By Gao Dengfeng Gendrano Jose Moon Bongki Snodgrass Richard Park Minseok Huang Bruce Rodrigue Jim

Distributed and Parallel Databases, Vol. 16, Iss. 2, 2004-09 ,pp. : 123-163

Springer Publishing Company

Access to resources Recommend Favorite