A complementary survey on double-loop networks

Theoretical Computer Science

Volumn 263, Issue 1-2, 2001, Pages 211-229

  Hwang, F K ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; STATISTICAL METHODS; THEOREM PROVING;

DOUBLE-LOOP NETWORKS; EUCLIDEAN ALGORITHMS;

COMPUTER SCIENCE;

EID: 0034927367     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00243-7     Document Type: Article

References (29)

1. An efficient algorithm to find optimal double loop networks
2. Distributed loop computer networks: A survey
3. The minimum distance diagram of double-loop networks
4. The spectrum of equivalent nondegenerate L-shapes of double-loop networks
5. Equivalent degenerate L-shapes of double-loop networks
6. Diameters of weighted double loop networks
7. Routing algorithms for double loop networks
8. Ring-network reliability with a constrained number of consecutively-bypassed stations
9. Distributed loop network with minimum transmission delay
10. Fault-tolerant routing in double-loop networks
11. Double commutative-step digraphs with minimum diameters
12. Ciclos de Hamilton en redes de pasos commutativos y de paso fijo
13. A discrete optimization problem in local networks and data alignment
14. A highly reliable distributed loop network architecture
15. An optimal message routing algorithm for double-loop networks
16. A survey on double loop networks
17. A permutation routing algorithm for double loop networks
18. Survival reliability of some double-loop networks and chordal rings
19. Exact reliabilities of most reliable double-loop networks
20. Double loop networks with minimum delay
21. Distributed loop computer networks
22. Analyzing the fault tolerance of double-loop networks
23. Reliable loop topologies for large local computer networks
24. A survey of multi-connected loop topologies for local computer networks
25. Weighted multi-connected loop networks
26. A combinatorial problem related to multimodule memory organizations