Pages that link to "Item:Q1929242"
From MaRDI portal
The following pages link to An algorithm to construct independent spanning trees on parity cubes (Q1929242):
Displaying 9 items.
- Constructing two completely independent spanning trees in hypercube-variant networks (Q338381) (← links)
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- Linear time algorithms for finding independent spanning trees on pyramid networks (Q2307502) (← 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)
- Edge-independent spanning trees in folded crossed cubes (Q6168082) (← links)
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength (Q6492014) (← links)
