Families of Fixed Degree Graphs for Processor Interconnection

DOI10.1109/TC.1984.1676410MaRDI QIDQ3311678zbMATH OpenFDO

Authors Sven Skyum, Mark Jerrum

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1984.1676410

zbMATH Keywords

interconnection networklow diameter graphsparallel computationundirected graph

Mathematics Subject Classification ID

Theory of operating systems (68N25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited in

(2)

• Graphs on alphabets as models for large interconnection networks
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks

This page was built for publication: Families of Fixed Degree Graphs for Processor Interconnection

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