Pages that link to "Item:Q4033766"
From MaRDI portal
The following pages link to Computing the Diameter in Multiple-Loop Networks (Q4033766):
Displaying 19 items.
- Forwarding and optical indices of 4-regular circulant networks (Q891819) (← links)
- Optimal routing in double loop networks (Q995561) (← links)
- Multiplicative circulant networks. Topological properties and communication algorithms (Q1364475) (← links)
- A family of network topologies with multiple loops and logarithmic diameter (Q1392075) (← links)
- The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
- A survey on multi-loop networks. (Q1874388) (← links)
- Vertex-colouring of 3-chromatic circulant graphs (Q2012064) (← links)
- Diameters of random circulant graphs (Q2439833) (← links)
- Dense bipartite circulants and their routing via rectangular twisted torus (Q2636804) (← links)
- A survey on undirected circulant graphs (Q2905302) (← links)
- (Q3073582) (← links)
- Diameters of weighted double loop networks (Q3792709) (← links)
- (Q4489583) (← links)
- (Q4693612) (← links)
- (Q5150427) (← links)
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR (Q5322920) (← links)
- Effective algorithm for finding shortest paths in dense Gaussian networks (Q5871442) (← links)
- Database analysis of optimal double-loop networks (Q6573400) (← links)
- On the broadcast independence number of circulant graphs (Q6637055) (← links)