Cluttered orderings for the complete bipartite graph (Q2576349): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3998644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal erasure-resilient codes for large disk arrays. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and pessimal orderings of Steiner triple systems in disk arrays. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ladder orderings of pairs and RAID performance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding techniques for handling failures in large disk arrays / rank
 
Normal rank

Revision as of 13:29, 11 June 2024

scientific article
Language Label Description Also known as
English
Cluttered orderings for the complete bipartite graph
scientific article

    Statements

    Cluttered orderings for the complete bipartite graph (English)
    0 references
    0 references
    0 references
    0 references
    27 December 2005
    0 references
    wrapped \(\Delta \)-labelling
    0 references
    RAID
    0 references

    Identifiers