Counting and computing the Rand and block distances of pairs of set partitions

DOI10.1016/j.jda.2012.04.003zbMath1257.05012OpenAlexW1966403111MaRDI QIDQ1932369

Yuji Yamauchi, Frank Ruskey, Jennifer Woodcock

Publication date: 18 January 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.003

zbMATH Keywords

generating functionsset partitionsBell numbersrefinementefficient algorithmsRand distance

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Bell and Stirling numbers (11B73)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Rand and Block Distances of Pairs of Set Partitions
• Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
• Data structures for maintaining set partitions
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Counting and computing the Rand and block distances of pairs of set partitions