Computing the Diameter in Multiple-Loop Networks
From MaRDI portal
Publication:4033766
Recommendations
Cited in
(18)- The obnoxious center problem on weighted cactus graphs.
- scientific article; zbMATH DE number 205764 (Why is no real title available?)
- Dense bipartite circulants and their routing via rectangular twisted torus
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- Vertex-colouring of 3-chromatic circulant graphs
- Effective algorithm for finding shortest paths in dense Gaussian networks
- Forwarding and optical indices of 4-regular circulant networks
- A survey on undirected circulant graphs
- Database analysis of optimal double-loop networks
- A survey on multi-loop networks.
- On the broadcast independence number of circulant graphs
- Diameters of random circulant graphs
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
- Optimal routing in double loop networks
- scientific article; zbMATH DE number 5850556 (Why is no real title available?)
- scientific article; zbMATH DE number 1474992 (Why is no real title available?)
- Diameters of weighted double loop networks
- Multiplicative circulant networks. Topological properties and communication algorithms
This page was built for publication: Computing the Diameter in Multiple-Loop Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033766)
