Pages that link to "Item:Q1109755"
From MaRDI portal
The following pages link to Fault-tolerant routings in a \(\kappa\)-connected network (Q1109755):
Displayed 13 items.
- A plane graph representation of triconnected graphs (Q410724) (← links)
- Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs (Q876733) (← links)
- Fault-tolerant routings in a \(\kappa\)-connected network (Q1109755) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Fault-tolerant routings in Kautz and de Bruijn networks (Q1123801) (← links)
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014) (← links)
- Optimal fault-tolerant routings for connected graphs (Q1186600) (← 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)
- Fault tolerant routing in the star and pancake interconnection networks (Q2365821) (← links)
- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs (Q6143971) (← links)
- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases (Q6184380) (← links)