A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks

DOI10.1007/978-3-319-71150-8_4MaRDI QIDQ1699757zbMATH OpenOpenAlexFDO

Authors Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Shyue-Ming Tang, Ro-Yu Wu

Publication date 26 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71150-8_4

zbMATH Keywords

fault-toleranceinterconnection networksnetwork securitystar networksvertex-disjoint spanning trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• scientific article; zbMATH DE number 714464
• On the construction of all shortest node-disjoint paths in star networks
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs

Cited in

(3)

• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
• Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks

This page was built for publication: A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699757)