Work‐efficient parallel union‐find

E-ISSN： 1532-0634|30|4|cpe.4333-cpe.4333

ISSN： 1532-0626

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

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

Efficient Union-Find for planar graphs and other sparse graph classes

By Gustedt J.

Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. : 123-141

Elsevier

Access to resources Recommend Favorite

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

By Myoupo Jean-Frédéric Semé David

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

Springer Publishing Company

Access to resources Recommend Favorite

Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines

By La Poutre H.

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 87-99

Academic Press

Access to resources Recommend Favorite

A work-efficient distributed algorithm for reachability analysis

By Grumberg Orna Heyman Tamir Schuster Assaf

Formal Methods in System Design, Vol. 29, Iss. 2, 2006-09 ,pp. : 157-175

Springer Publishing Company

Access to resources Recommend Favorite

Two linear time Union-Find strategies for image processing

By Fiorio C. Gustedt J.

Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. : 165-181

Elsevier

Access to resources Recommend Favorite