Data structures for maintaining set partitions
From MaRDI portal
Publication:4810507
DOI10.1002/rsa.20025zbMath1077.68021MaRDI 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
random walks; data structures; set partitions; decision trees; approximation algorithms; randomized algorithms
Related Items
A note on data structures for maintaining bipartitions, Counting and computing the Rand and block distances of pairs of set partitions
Cites Work