Author: Fiorio C. Gustedt J.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.154, Iss.2, 1996-02, pp. : 165-181
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. :
Efficient Union-Find for planar graphs and other sparse graph classes
By Gustedt J.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :