Cluttered orderings for the complete graph

DOI10.1007/3-540-44679-6_48MaRDI QIDQ4551381zbMATH OpenFDO

Authors Myra B. Cohen, Charles J. Colbourn, Dalibor Fronček

Publication date 5 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080420

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Ladder orderings of pairs and RAID performance.
• Cluttered orderings for the complete bipartite graph
• scientific article; zbMATH DE number 2170489
• Optimal ordering for the complete tripartite graph \(K_{9,9,9}\)
• Some construction of cluttered orderings for the complete bipartite graph

Cited in

(9)

• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Ladder orderings of pairs and RAID performance.
• Egalitarian edge orderings of complete graphs
• Cluttered orderings for the complete bipartite graph
• Some construction of cluttered orderings for the complete bipartite graph
• Optimal ordering for the complete tripartite graph \(K_{9,9,9}\)
• Optimal and pessimal orderings of Steiner triple systems in disk arrays
• A cyclic ordering of composition from bipartite graphs and its application to RAID
• Some new results on cluttered ordering on several special bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551381)