Pages that link to "Item:Q2638205"
From MaRDI portal
The following pages link to Constructing edge-disjoint spanning trees in twisted cubes (Q2638205):
Displaying 14 items.
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426) (← links)
- The generalized 4-connectivity of hypercubes (Q507578) (← links)
- Embedding meshes into twisted-cubes (Q545387) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← 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)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Fault-tolerant embedding of meshes/tori in twisted cubes (Q3008367) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
- Independent spanning trees in crossed cubes (Q5920317) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)