Sparse topologies with small spectrum size
From MaRDI portal
Publication:1885049
DOI10.1016/S0304-3975(03)00237-8zbMath1070.68120MaRDI QIDQ1885049
Burkhard Monien, Rastislav Královič, Robert Elsässer
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Graphs for small multiprocessor interconnection networks ⋮ Graph spectra in computer science ⋮ MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random shuffles and group representations
- Strongly regular graphs
- First- and second-order diffusive methods for rapid, coarse, distributed load balancing
- The spectrum of de Bruijn and Kautz graphs
- An improved diffusion algorithm for dynamic load balancing.
- A group-theoretic model for symmetric interconnection networks
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Efficient schemes for nearest neighbor load balancing
- A new 5‐arc‐transitive cubic graph
This page was built for publication: Sparse topologies with small spectrum size
