Cluttered orderings for the complete bipartite graph

DOI10.1016/j.dam.2005.06.005zbMath1080.05083OpenAlexW1985390352MaRDI QIDQ2576349

Masakazu Jimbo, Meinard Müller, Tomoko Adachi

Publication date: 27 December 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.06.005

zbMATH Keywords

RAIDwrapped \(\Delta \)-labelling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Inventory, storage, reservoirs (90B05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Cyclic sequences of \(k\)-subsets with distinct consecutive unions ⋮ Generalized edge-magic total labellings of models from researching networks

Cites Work

• Unnamed Item
• Unnamed Item
• Coding techniques for handling failures in large disk arrays
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Ladder orderings of pairs and RAID performance.
• Asymptotically optimal erasure-resilient codes for large disk arrays.

This page was built for publication: Cluttered orderings for the complete bipartite graph