Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance

DOI10.1016/S0167-8191(02)00073-XzbMath0995.68185OpenAlexW2023251759MaRDI QIDQ1605473

Abderezak Touzene

Publication date: 15 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(02)00073-x

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs

This page was built for publication: Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance