Edge-disjoint spanning trees for the generalized butterfly networks and their applications

DOI10.1016/J.JPDC.2005.05.009MaRDI QIDQ2575864zbMATH OpenOpenAlexFDO

Authors Abderezak Touzene, Burkhard Monien, K. Day

Publication date 7 December 2005

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.05.009

zbMATH Keywords

scattering algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• Edge-connectivity and edge-disjoint spanning trees
• Edge-disjoint spanning trees and forests of graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Edge disjoint spanning trees in random graphs
• On edge-disjoint spanning trees in hypercubes
• Edge‐disjoint spanning trees: A connectedness theorem
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph

Cited in

(6)

• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• Constructing edge-disjoint spanning trees in twisted cubes
• Completely independent spanning trees in torus networks
• The geodesic cover problem for butterfly networks
• Properties of Euclidean minimum weight (k, )-tight graphs
• On completely edge-independent spanning trees in locally twisted cubes

This page was built for publication: Edge-disjoint spanning trees for the generalized butterfly networks and their applications

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