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

Author： Gustedt J.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

By  

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

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

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

Forced color classes, intersection graphs and the strong perfect graph conjecture

By Sakuma T.  

Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. : 309-324

Elsevier

Access to resources Recommend Favorite

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

By Parfenoff I.  

Journal of Parallel and Distributed Computing, Vol. 52, Iss. 1, 1998-07 ,pp. : 96-108

Academic Press

Access to resources Recommend Favorite