Data structures for maintaining set partitions

DOI10.1002/RSA.20025MaRDI QIDQ4810507zbMATH OpenOpenAlexFDO

Authors Saurabh Sethia, Michael A. Bender, Steven Skiena

Publication date 16 August 2004

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

decision treesdata structuresrandomized algorithmsapproximation algorithmsrandom walksset partitions

Mathematics Subject Classification ID

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

Recommendations

• A note on data structures for maintaining bipartitions
• scientific article; zbMATH DE number 5050579
• Efficient partition trees
• An efficient algorithm for computing the distance between close partitions
• scientific article; zbMATH DE number 4213488

Cites work

• scientific article; zbMATH DE number 1617250 (Why is no real title available?)
• scientific article; zbMATH DE number 432751 (Why is no real title available?)
• scientific article; zbMATH DE number 437544 (Why is no real title available?)
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 742985 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Probing polygons minimally is hard

Cited in

(2)

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

This page was built for publication: Data structures for maintaining set partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810507)