Computing the Diameter in Multiple-Loop Networks

DOI10.1006/JAGM.1993.1011zbMATH Open0764.68137OpenAlexW2094835765MaRDI QIDQ4033766FDOQ4033766

Authors: Janez Žerovnik, Tomaž Pisanski 

Publication date: 16 May 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1011

Recommendations

• scientific article; zbMATH DE number 205764
• scientific article; zbMATH DE number 1908099
• An efficient algorithm to find optimal double loop networks
• scientific article
• Computational and Information Science

zbMATH Keywords

algorithmCayley graphdiametercomputing diametersmultiple-loop network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (18)

• Forwarding and optical indices of 4-regular circulant networks
• Diameters of weighted double loop networks
• Vertex-colouring of 3-chromatic circulant graphs
• Diameters of random circulant graphs
• Database analysis of optimal double-loop networks
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• Effective algorithm for finding shortest paths in dense Gaussian networks
• A survey on multi-loop networks.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dense bipartite circulants and their routing via rectangular twisted torus
• Optimal routing in double loop networks
• The obnoxious center problem on weighted cactus graphs.
• On the broadcast independence number of circulant graphs
• A survey on undirected circulant graphs
• Title not available (Why is that?)
• 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)