The shuffle exchange network has a Hamiltonian path

DOI10.1007/3-540-55808-X_23zbMath1494.68193MaRDI QIDQ5096836

P. Mysliwietz, Rainer Feldmann

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

A ranking algorithm for Hamilton paths in shuffle-exchange graphs ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks

Cites Work

• Unnamed Item
• Group Action Graphs and Parallel Architectures
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Updating the hamiltonian problem—A survey
• Parallel Processing with the Perfect Shuffle

This page was built for publication: The shuffle exchange network has a Hamiltonian path