The generalized folding-cube network

DOI10.1002/NET.3230210303MaRDI QIDQ3204022zbMATH OpenOpenAlexFDO

Authors Arun K. Somani, Sangbang Choi

Publication date 1991

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230210303

zbMATH Keywords

routingn-dimensional cubemultiprocessor network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Routing a permutation in the hypercube by two sets of edge disjoint paths
• Hypercube permutations routable under all dimension orderings
• Some permutation routing algorithms for low-dimensional hypercubes
• scientific article; zbMATH DE number 1717254
• Arbitrary group permutations on hypercube and nonblocability of cube-connected cycles

Cites work

• scientific article; zbMATH DE number 3848585 (Why is no real title available?)
• scientific article; zbMATH DE number 3225079 (Why is no real title available?)
• A fast parallel algorithm for routing in permutation networks
• Proving the Rearrangeability of Connecting Networks by Group Calculations

Cited in

(3)

• scientific article; zbMATH DE number 5846238 (Why is no real title available?)
• The helical cube network
• scientific article; zbMATH DE number 1717254 (Why is no real title available?)

This page was built for publication: The generalized folding-cube network

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