Spanning subgraphs with applications to communication on the multidimensional torus network

DOI10.1016/0167-8191(96)00029-4zbMATH Open0900.68027OpenAlexW2082354586WikidataQ128040117 ScholiaQ128040117MaRDI QIDQ671635FDOQ671635

Authors: P. Fragopoulou, Selim G. Akl 

Publication date: 27 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(96)00029-4

Recommendations

• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Multicast in wormhole-switched torus networks using edge-disjoint spanning trees.
• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• Spanning Balanced Trees in Boolean Cubes

zbMATH Keywords

Communication algorithmInterconnection networkMultidimensional torusSpanning subgraph

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Cited In (7)

• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• Acyclic k-connected subgraphs for distributed alternate routing in communications networks
• Spanning Balanced Trees in Boolean Cubes
• Broadcasting in wraparound meshes with parallel monodirectional links
• Efficient Internode Communications in Reconfigurable Binary Trees
• Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
• Circuit-switched broadcasting in multi-port multi-dimensional torus networks

This page was built for publication: Spanning subgraphs with applications to communication on the multidimensional torus network

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