scientific article; zbMATH DE number 828043

zbMATH Open0838.68051MaRDI QIDQ4859009FDOQ4859009

Authors: Fred S. Annexstein 

Publication date: 27 May 1996

Title of this publication is not available (Why is that?)

Recommendations

• A ranking algorithm for Hamilton paths in shuffle-exchange graphs
• Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays
• List-ranking on interconnection networks.
• Node-ranking schemes for the star networks.
• Parallel sorting on Cayley graphs

zbMATH Keywords

Hamiltonian pathranking algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distributed algorithms (68W15)

Cited In (4)

• Sorting-based selection algorithms for hypercubic networks
• Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays
• Uniform homomorphisms of de Bruijn and Kautz networks
• A ranking algorithm for Hamilton paths in shuffle-exchange graphs

This page was built for publication:

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