Pages that link to "Item:Q2053847"
From MaRDI portal
The following pages link to Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847):
Displaying 8 items.
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes (Q2043017) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- Constructing dual-CISTs of folded divide-and-swap cubes (Q2219061) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)
- A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks (Q6569892) (← links)
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs (Q6648248) (← links)
- Vertex-independent spanning trees in complete Josephus cubes (Q6652471) (← links)
