Counting and computing the Rand and block distances of pairs of set partitions (Q1932369): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2012.04.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1966403111
@@ Property / OpenAlex ID: W1966403111 / rank @@
+Normal rank
@@ Property / cites work @@
+Data structures for maintaining set partitions
@@ Property / cites work: Data structures for maintaining set partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
+Normal rank
@@ Property / cites work @@
+Q4040797
@@ Property / cites work: Q4040797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2957449
@@ Property / cites work: Q2957449 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3226891
@@ Property / cites work: Q3226891 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Algorithms for Listing Equivalence Classes of <i>k</i>-ary Strings
+Normal rank
@@ Property / cites work @@
+Q4268449
@@ Property / cites work: Q4268449 / rank @@
+Normal rank
@@ Property / cites work @@
+The Rand and Block Distances of Pairs of Set Partitions
+Normal rank
@@ Property / cites work @@
+Q4443440
@@ Property / cites work: Q4443440 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3748279
@@ Property / cites work: Q3748279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3726126
@@ Property / cites work: Q3726126 / rank @@
+Normal rank