Pages that link to "Item:Q2246461"
From MaRDI portal
The following pages link to Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461):
Displaying 3 items.
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- The disjoint path cover in the data center network HSDC with prescribed vertices in each path (Q6048642) (← links)
- Edge-independent spanning trees in folded crossed cubes (Q6168082) (← links)
