Pages that link to "Item:Q2442959"
From MaRDI portal
The following pages link to Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959):
Displaying 11 items.
- A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- The generalized 4-connectivity of hypercubes (Q507578) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
