A complementary survey on double-loop networks

DOI10.1016/S0304-3975(00)00243-7zbMath0974.68003OpenAlexW2093900597MaRDI QIDQ5941514

Frank K. Hwang

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00243-7

zbMATH Keywords

double-loop networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (26)

A simple algorithm to find the steps of double-loop networks ⋮ A survey on multi-loop networks. ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ A new method for constructing infinite families of \(k\)-tight optimal double loop networks ⋮ Decompositions of circulant-balanced complete multipartite graphs based on a novel labelling approach ⋮ Connectedness of finite distance graphs ⋮ Network(graph) data research in the coordinate system ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ The existence of hyper-L triple-loop networks. ⋮ Hamiltonian numbers of Möbius double loop networks ⋮ The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks ⋮ On Motzkin's problem in the circle group ⋮ Procreating tiles of double commutative-step digraphs ⋮ Spanning trees in directed circulant graphs and cycle power graphs ⋮ On Hamiltonian paths in distance graphs ⋮ Long cycles and paths in distance graphs ⋮ Tessellating polyominos in the plane ⋮ An efficient algorithm to find a double-loop network that realizes a given L-shape ⋮ Improved upper and lower bounds on the optimization of mixed chordal ring networks ⋮ Optimal routing in double loop networks ⋮ Rotational circulant graphs ⋮ Geometric proof of Rødseth's formula for Frobenius numbers ⋮ Connectivity and diameter in distance graphs ⋮ Triple-loop networks with arbitrarily many minimum distance diagrams ⋮ Embedding connected double-loop networks with even cardinality in books ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal message routing algorithm for double-loop networks
• Double commutative-step digraphs with minimum diameters
• Distributed loop network with minimum transmission delay
• Double loop networks with minimum delay
• An efficient algorithm to find optimal double loop networks
• Weighted multi-connected loop networks
• Diameters of weighted double loop networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Exact reliabilities of most reliable double-loop networks
• Survival reliability of some double-loop networks and chordal rings
• Equivalent nondegenerate L-shapes of double-loop networks
• ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
• Equivalent double-loop networks

This page was built for publication: A complementary survey on double-loop networks