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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Data structures for maintaining set partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3226891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Algorithms for Listing Equivalence Classes of <i>k</i>-ary Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rand and Block Distances of Pairs of Set Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726126 / rank
 
Normal rank

Latest revision as of 02:17, 6 July 2024

scientific article
Language Label Description Also known as
English
Counting and computing the Rand and block distances of pairs of set partitions
scientific article

    Statements

    Counting and computing the Rand and block distances of pairs of set partitions (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2013
    0 references
    set partitions
    0 references
    Rand distance
    0 references
    efficient algorithms
    0 references
    Bell numbers
    0 references
    refinement
    0 references
    generating functions
    0 references

    Identifiers