Computing the Diameter in Multiple-Loop Networks

DOI10.1006/jagm.1993.1011zbMath0764.68137OpenAlexW2094835765MaRDI QIDQ4033766

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

zbMATH Keywords

algorithmCayley graphdiametercomputing diametersmultiple-loop network

Mathematics Subject Classification ID

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

Related Items (12)

A survey on multi-loop networks. ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Dense bipartite circulants and their routing via rectangular twisted torus ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ Diameters of random circulant graphs ⋮ The obnoxious center problem on weighted cactus graphs. ⋮ Vertex-colouring of 3-chromatic circulant graphs ⋮ Optimal routing in double loop networks ⋮ Unnamed Item ⋮ Effective algorithm for finding shortest paths in dense Gaussian networks

This page was built for publication: Computing the Diameter in Multiple-Loop Networks