Pages that link to "Item:Q1944080"
From MaRDI portal
The following pages link to Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080):
Displaying 9 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)
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
- A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks (Q1699757) (← links)
- Constructing independent spanning trees on bubble-sort networks (Q1790945) (← links)
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
- Linear time algorithms for finding independent spanning trees on pyramid networks (Q2307502) (← 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)