Pages that link to "Item:Q1288475"
From MaRDI portal
The following pages link to Generalized diameters and Rabin numbers of networks (Q1288475):
Displaying 15 items.
- A diagnosis algorithm by using graph-coloring under the PMC model (Q326504) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341) (← links)
- On reliability of the folded hypercubes (Q881847) (← links)
- The spanning connectivity of folded hypercubes (Q991888) (← links)
- Hamiltonian connectivity of the WK-recursive network with faulty nodes (Q1031676) (← links)
- Rabin numbers of Butterfly networks (Q1297411) (← links)
- Fault-tolerant routing in circulant networks and cycle prefix networks (Q1305199) (← links)
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges (Q2385484) (← links)
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019) (← links)
- Cycles in folded hypercubes (Q2488687) (← links)
- Strong Rabin numbers of folded hypercubes (Q2566009) (← links)
- Efficient Parallel Routing Algorithms for Cartesian and Composition Networks (Q3628471) (← links)
- Property <i>P</i><sub><i>d</i>,<i>m</i></sub> and efficient design of reliable networks (Q5326767) (← links)
- Reliability measures in brother trees (Q6560777) (← links)
