Graphs for small multiprocessor interconnection networks
From MaRDI portal
Publication:606803
DOI10.1016/j.amc.2010.07.058zbMath1200.05236OpenAlexW2005133610MaRDI QIDQ606803
Tatjana Davidović, Aleksandar Ilić, Dragos Cvetković, Slobodan K. Simic
Publication date: 18 November 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.07.058
Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Mathematical problems of computer architecture (68M07)
Related Items
Graph spectra in computer science ⋮ Remarks on dynamic load balancing of integer loads and integral graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The energy of unitary Cayley graphs
- A table of connected graphs on six vertices
- Perfect state transfer in integral circulant graphs
- Walks and regular integral graphs
- Recent results in the theory of graph spectra
- Sparse topologies with small spectrum size
- On some algorithmic investigations of star partitions of graphs
- A study of eigenspaces of graphs
- MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
- Application of some graph invariants to the analysis of multiprocessor interconnection networks
- A survey on integral graphs
- PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
- Efficient schemes for nearest neighbor load balancing
This page was built for publication: Graphs for small multiprocessor interconnection networks