The recognition of union trees

DOI10.1016/0020-0190(93)90037-AzbMath0768.68109OpenAlexW2029770599MaRDI QIDQ2365813

Leizhen Cai

Publication date: 29 June 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90037-a

zbMATH Keywords

design of algorithmspolynomial-time algorithmrooted treesdisjoint-set unionunion tree-recognition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Recognizing union-find trees is NP-complete ⋮ Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info

Cites Work

• Unnamed Item
• Unnamed Item
• Worst-case Analysis of Set Union Algorithms
• An improved equivalence algorithm

This page was built for publication: The recognition of union trees