A complementary survey on double-loop networks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 176256
- A survey on multi-loop networks.
- Designing of optimal double loop networks
- scientific article; zbMATH DE number 853690
- scientific article; zbMATH DE number 19191
- scientific article; zbMATH DE number 1908099
- The infinite families of optimal double loop networks
- On infinite families of tight optimal double loop networks
- On \(k\)-tight optimal double-loop networks
Cites work
- scientific article; zbMATH DE number 4059299 (Why is no real title available?)
- scientific article; zbMATH DE number 176256 (Why is no real title available?)
- scientific article; zbMATH DE number 4128836 (Why is no real title available?)
- A Combinatorial Problem Related to Multimodule Memory Organizations
- An efficient algorithm to find optimal double loop networks
- An optimal message routing algorithm for double-loop networks
- Diameters of weighted double loop networks
- Distributed loop network with minimum transmission delay
- Double commutative-step digraphs with minimum diameters
- Double loop networks with minimum delay
- Equivalent double-loop networks
- Equivalent nondegenerate L-shapes of double-loop networks
- Exact reliabilities of most reliable double-loop networks
- ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
- Survival reliability of some double-loop networks and chordal rings
- Weighted multi-connected loop networks
Cited in
(26)- Forwarding and optical indices of 4-regular circulant networks
- A simple algorithm to find the steps of double-loop networks
- Network(graph) data research in the coordinate system
- On Motzkin's problem in the circle group
- The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks
- Improved upper and lower bounds on the optimization of mixed chordal ring networks
- A new method for constructing infinite families of \(k\)-tight optimal double loop networks
- Triple-loop networks with arbitrarily many minimum distance diagrams
- A survey on multi-loop networks.
- Tessellating polyominos in the plane
- Long cycles and paths in distance graphs
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- Embedding connected double-loop networks with even cardinality in books
- Rotational circulant graphs
- Hamiltonian numbers of Möbius double loop networks
- Decompositions of circulant-balanced complete multipartite graphs based on a novel labelling approach
- Optimal routing in double loop networks
- Connectedness of finite distance graphs
- Geometric proof of Rødseth's formula for Frobenius numbers
- Connectivity and diameter in distance graphs
- The existence of hyper-L triple-loop networks.
- An efficient algorithm to find a double-loop network that realizes a given L-shape
- A survey on undirected circulant graphs
- On Hamiltonian paths in distance graphs
- Spanning trees in directed circulant graphs and cycle power graphs
- Procreating tiles of double commutative-step digraphs
This page was built for publication: A complementary survey on double-loop networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941514)