Pages that link to "Item:Q505426"
From MaRDI portal
The following pages link to A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426):
Displaying 13 items.
- Constructing independent spanning trees for locally twisted cubes (Q533862) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- Reliability analysis of twisted cubes (Q1685973) (← links)
- Cycles embedding in balanced hypercubes with faulty edges and vertices (Q1701112) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- Independent spanning trees in crossed cubes (Q5920317) (← links)
- Vertex-independent spanning trees in complete Josephus cubes (Q6652471) (← links)