Pages that link to "Item:Q668143"
From MaRDI portal
The following pages link to A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143):
Displaying 10 items.
- A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← 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)
- Modelling simultaneous broadcasting by level-disjoint partitions (Q2279226) (← 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)
- Independent spanning trees in crossed cubes (Q5920317) (← links)