Data structures for maintaining set partitions

DOI10.1002/rsa.20025zbMath1077.68021OpenAlexW2142133444MaRDI QIDQ4810507

Saurabh Sethia, Michael A. Bender, Steven S. Skiena

Publication date: 16 August 2004

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20025

zbMATH Keywords

random walksdata structuresset partitionsdecision treesapproximation algorithmsrandomized algorithms

Mathematics Subject Classification ID

Partitions of sets (05A18) Data structures (68P05)

Related Items

Counting and computing the Rand and block distances of pairs of set partitions ⋮ A note on data structures for maintaining bipartitions

Cites Work

• Probing polygons minimally is hard
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item