Edge-Disjoint Spanning Trees on Star-Product Networks
<|reference_start|>Edge-Disjoint Spanning Trees on Star-Product Networks: Star-product graphs are a natural extension of the Cartesian product, but have not been well-studied. We show that many important established and emerging network topologies, including HyperX, SlimFly, BundleFly, PolarStar, mesh, and torus, are in fact star-product graphs. While this connection was known for BundleFly and PolarStar, it was not for the others listed.   We extend a method of constructing maximal and near-maximal sets of edge-disjoint spanning trees on Cartesian products to the star product, thus obtain maximal or near-maximal sets of edge-disjoint spanning trees on new networks of importance, where such sets can improve bandwidth of collective operations and therefore accelerate many important workloads in high-performance computing.<|reference_end|>
@article{dawkins2024edge-disjoint,
    title={Edge-Disjoint Spanning Trees on Star-Product Networks},
    author={Aleyah Dawkins, Kelly Isham, Ales Kubicek, Kartik Lakhotia, Laura
  Monroe},
    journal={arXiv preprint arXiv:2403.12231},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.12231},
    primaryClass={cs.NI cs.DC math.CO}
}