Pages that link to "Item:Q2317871"
From MaRDI portal
The following pages link to A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871):
Displaying 6 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)
