Pages that link to "Item:Q5971214"
From MaRDI portal
The following pages link to Independent spanning trees in crossed cubes (Q5971214):
Displaying 14 items.
- A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- Complete binary trees embeddings in Möbius cubes (Q896018) (← 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)
- 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)
- 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 Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
