Intersection reporting on two collections of disjoint sets
From MaRDI portal
Publication:1818976
DOI10.1016/S0020-0255(99)80001-2zbMath0948.68063MaRDI QIDQ1818976
Guido Proietti, Enrico Nardelli, Carlo Gaibisso
Publication date: 5 January 2000
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(99)80001-2
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Truly concurrent constraint programming
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
- Worst-case Analysis of Set Union Algorithms
- A data structure for manipulating priority queues