Analysis of the total costs for variants of the Union-Find algorithm

Markus Kuba, Alois Panholzer

Open source

DOI
10.46298/dmtcs.3535
Published
2007-01-01
Container
Discrete Mathematics & Theoretical Computer Science
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.46298/dmtcs.3535,
  title = {Analysis of the total costs for variants of the Union-Find algorithm},
  author = {Markus Kuba and Alois Panholzer},
  year = {2007},
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  doi = {10.46298/dmtcs.3535},
  url = {https://doi.org/10.46298/dmtcs.3535}
}

RIS

TY  - JOUR
TI  - Analysis of the total costs for variants of the Union-Find algorithm
AU  - Markus Kuba
AU  - Alois Panholzer
PY  - 2007
JO  - Discrete Mathematics & Theoretical Computer Science
DO  - 10.46298/dmtcs.3535
UR  - https://doi.org/10.46298/dmtcs.3535
ER  - 

APA

Kuba, M., & Panholzer, A. (2007). Analysis of the total costs for variants of the Union-Find algorithm. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.46298/dmtcs.3535

Source records