A ranking algorithm for Hamilton paths in shuffle-exchange graphs

DOI10.1007/3-540-60220-8_68MaRDI QIDQ5057440zbMATH OpenOpenAlexFDO

Authors Fred S. Annexstein, Eugene A. Kuchko

Publication date 16 December 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60220-8_68

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 828043
• The shuffle exchange network has a Hamiltonian path
• List-ranking on interconnection networks.
• The shuffle exchange network has a Hamiltonian path
• Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays

Cites work

• scientific article; zbMATH DE number 4137767 (Why is no real title available?)
• Parallel sorting on Cayley graphs
• The shuffle exchange network has a Hamiltonian path

Cited in

(4)

• scientific article; zbMATH DE number 828043 (Why is no real title available?)
• The shuffle exchange network has a Hamiltonian path
• The shuffle exchange network has a Hamiltonian path
• Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays

This page was built for publication: A ranking algorithm for Hamilton paths in shuffle-exchange graphs

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