Total exchange algorithms on 'sandwich graphs'

DOI10.1016/0898-1221(91)90191-6zbMath0753.68047OpenAlexW2088408040MaRDI QIDQ1192165

Veerle Fack, Kris Coolsaet

Publication date: 27 September 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90191-6

zbMATH Keywords

hypercubeparallel computingoptimal algorithmtotal exchange

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Optimal algorithms for total exchange without buffering on the hypercube

Cites Work

• Unnamed Item
• Data communication in parallel architectures

This page was built for publication: Total exchange algorithms on 'sandwich graphs'