Pages that link to "Item:Q1099603"
From MaRDI portal
The following pages link to A new look at fault-tolerant network routing (Q1099603):
Displaying 17 items.
- Fault-tolerant fixed routing in hypercube generalizations (Q699637) (← links)
- Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs (Q876733) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- Efficient fault-tolerant routings in networks (Q1091360) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Optimal fault-tolerant routings for connected graphs (Q1186600) (← links)
- Analysis of minimal path routing schemes in the presence of faults (Q1199428) (← links)
- Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs (Q1199456) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- On fault-tolerant fixed routing in hypercubes (Q1332767) (← links)
- Artificial intelligence search techniques as fault-tolerant routing strategies (Q1349816) (← links)
- Uniform multi-hop all-to-all optical routings in rings. (Q1401312) (← links)
- A multi-tree routing scheme using acyclic orientations (Q1575452) (← links)
- A generalization of hypercubes: Complemented graphs (Q1808497) (← links)
- Fault tolerant routing in the star and pancake interconnection networks (Q2365821) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Fault-tolerant routing in peer-to-peer systems (Q5170882) (← links)
