Rearrangeability of (2_n N-1)-stage networks employing a uniform connection pattern

DOI10.1007/S100920170005zbMATH Open1168.94523OpenAlexW2027860296MaRDI QIDQ2368634FDOQ2368634

Authors: Rza Bashirov 

Publication date: 26 April 2006

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s100920170005

Recommendations

• scientific article; zbMATH DE number 2080547
• Rearrangeability of multistage shuffle/exchange networks
• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• scientific article; zbMATH DE number 4063007
• On the Rearrangeability of 2(Iog₂N) –1 Stage Permutation Networks

Mathematics Subject Classification ID

Cited In (7)

• Title not available (Why is that?)
• A two‐stage network with dual partial concentrators
• Exploiting colored Petri nets to decide on permutation admissibility
• On the rearrangeability of shuffle-exchange networks
• Rearrangeability of multistage shuffle/exchange networks
• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• Analyzing permutation capability of multistage interconnection networks with colored Petri nets

This page was built for publication: Rearrangeability of \((2\log_n N-1)\)-stage networks employing a uniform connection pattern

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