Pages that link to "Item:Q2275932"
From MaRDI portal
The following pages link to Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932):
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)
- A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← 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)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← 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)
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019) (← links)
- Edge-independent spanning trees in folded crossed cubes (Q6168082) (← links)
