Pages that link to "Item:Q5187853"
From MaRDI portal
The following pages link to CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853):
Displaying 7 items.
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
