Optimal Union-Find in Constraint Handling Rules
<|reference_start|>Optimal Union-Find in Constraint Handling Rules: Constraint Handling Rules (CHR) is a committed-choice rule-based language that was originally intended for writing constraint solvers. In this paper we show that it is also possible to write the classic union-find algorithm and variants in CHR. The programs neither compromise in declarativeness nor efficiency. We study the time complexity of our programs: they match the almost-linear complexity of the best known imperative implementations. This fact is illustrated with experimental results.<|reference_end|>
@article{schrijvers2005optimal,
    title={Optimal Union-Find in Constraint Handling Rules},
    author={Tom Schrijvers and Thom Fruehwirth},
    journal={arXiv preprint arXiv:cs/0501073},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0501073},
    primaryClass={cs.PL cs.CC cs.DS cs.PF}
}