Amanote Research

Amanote Research

    RegisterSign In

Data Structures and Algorithms for Disjoint Set Union Problems

ACM Computing Surveys - United States
doi 10.1145/116873.116878
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

September 1, 1991

Authors
Zvi GalilGiuseppe F. Italiano
Publisher

Association for Computing Machinery (ACM)


Related search

Disjoint Set Union With Randomized Linking

2013English

Algorithms and Data Structures

1997English

Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

The Ramsey Numbers for Disjoint Union of Stars

Journal of the Indonesian Mathematical Society
2010English

PyEDA: Data Structures and Algorithms for Electronic Design Automation

2015English

Data Structures and Algorithms for the String Statistics Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1996English

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy