MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
From MaRDI portal
Recommendations
- Well-suited multiprocessor topologies with small number of processors
- Multiprocessor interconnection networks
- Multiprocessor interconnection networks
- Application of some graph invariants to the analysis of multiprocessor interconnection networks
- Exhaustive search for multiprocessor interconnection networks with small tightness value
Cites work
- A table of connected graphs on six vertices
- Application of some graph invariants to the analysis of multiprocessor interconnection networks
- scientific article; zbMATH DE number 42110 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- Interconnection Networks and Their Eigenvalues
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Recent results in the theory of graph spectra
- Sparse topologies with small spectrum size
- The minimal spectral radius of graphs with a given diameter
Cited in
(18)- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs
- Shaped lattice graphs as models of the multiprocessor computer systems
- scientific article; zbMATH DE number 1688366 (Why is no real title available?)
- Multiprocessor interconnection networks
- Well-suited multiprocessor topologies with small number of processors
- Multiprocessor interconnection networks
- Exhaustive search for multiprocessor interconnection networks with small tightness value
- Application of some graph invariants to the analysis of multiprocessor interconnection networks
- scientific article; zbMATH DE number 510703 (Why is no real title available?)
- Some new models for multiprocessor interconnection networks
- Interconnection Networks and Their Eigenvalues
- Graphs for small multiprocessor interconnection networks
- On the Laplacian spectrum of k-symmetric graphs
- Spectral analysis of weighted neighborhood networks
- The folded Petersen network: A new versatile multiprocessor interconnection topology
- Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I
- Graph spectra in computer science
- The \(A_{\alpha}\)-spectrum and \(A_{\alpha}\)-energy of the dice lattice
This page was built for publication: MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3646175)