Author： La Poutre H.
Publisher： Academic Press
ISSN： 0022-0000
Source： Journal of Computer and System Sciences, Vol.52, Iss.1, 1996-02, pp. : 87-99
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Work‐efficient parallel union‐find
CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 30, Iss. 4, 2018-02 ,pp. :
Access to resources
Recommend
Two linear time Union-Find strategies for image processing
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
Efficient Union-Find for planar graphs and other sparse graph classes
By Gustedt J.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
The Charleston Advisor, Vol. 11, Iss. 4, 2010-04 ,pp. :
The Charleston Advisor, Vol. 11, Iss. 3, 2010-01 ,pp. :