Data structures for maintaining set partitions (Q4810507): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142133444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing polygons minimally is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763424 / rank
 
Normal rank

Latest revision as of 20:01, 6 June 2024

scientific article; zbMATH DE number 2091606
Language Label Description Also known as
English
Data structures for maintaining set partitions
scientific article; zbMATH DE number 2091606

    Statements

    Data structures for maintaining set partitions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2004
    0 references
    0 references
    set partitions
    0 references
    decision trees
    0 references
    randomized algorithms
    0 references
    approximation algorithms
    0 references
    data structures
    0 references
    random walks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references