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

DOI10.1016/J.JPDC.2005.05.009zbMath1101.68356OpenAlexW1971169897MaRDI QIDQ2575864

Burkhard Monien, Abderezak Touzene, Khaled 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)

Related Items (2)

Constructing edge-disjoint spanning trees in twisted cubes ⋮ Completely independent spanning trees in torus networks

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