Egalitarian edge orderings of complete graphs
From MaRDI portal
Publication:2042215
DOI10.1007/s00373-021-02326-5zbMath1469.05148OpenAlexW3158407293MaRDI QIDQ2042215
Publication date: 28 July 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02326-5
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Egalitarian Steiner quadruple systems of doubly even order, Egalitarian Steiner triple systems for data popularity
Cites Work
- Ordering block designs. Gray codes, universal cycles and configuration orderings
- Ladder orderings of pairs and RAID performance.
- Access balancing in storage systems by labeling partial Steiner systems
- MaxMinSum Steiner Systems for Access Balancing in Distributed Storage
- Supermagic Complete Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item