Optimal data exchange algorithms on star graphs

DOI10.1016/0898-1221(94)90042-6zbMath0805.68015OpenAlexW2061231719WikidataQ126654302 ScholiaQ126654302MaRDI QIDQ1324416

Veerle Fack, Kris Coolsaet

Publication date: 23 January 1995

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

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

zbMATH Keywords

Cayley graphstar graphstotal exchangenetwork of parallel processorsodd-distance data exchange

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal algorithms for total exchange without buffering on the hypercube
• Parallel concepts in graph theory
• Data communication in parallel architectures
• Topological properties of star graphs

This page was built for publication: Optimal data exchange algorithms on star graphs