Pages that link to "Item:Q2359799"
From MaRDI portal
The following pages link to Construction independent spanning trees on locally twisted cubes in parallel (Q2359799):
Displaying 14 items.
- A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426) (← links)
- Constructing independent spanning trees for locally twisted cubes (Q533862) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074) (← links)
- Improving the diameters of completely independent spanning trees in locally twisted cubes (Q1621502) (← links)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- Embedding mutually edge-disjoint cycles into locally twisted cubes (Q2166726) (← links)
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
- Linear time algorithms for finding independent spanning trees on pyramid networks (Q2307502) (← links)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
