Pages that link to "Item:Q5920317"
From MaRDI portal
The following pages link to Independent spanning trees in crossed cubes (Q5920317):
Displaying 13 items.
- A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← 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)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← 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)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- Independent spanning trees on folded hyper-stars (Q3064044) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)
- Edge-independent spanning trees in folded crossed cubes (Q6168082) (← links)