The generalized folding-cube network

DOI10.1002/NET.3230210303zbMATH Open0716.68009OpenAlexW1995741929MaRDI QIDQ3204022FDOQ3204022

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

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

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)

Cites Work

• Title not available (Why is that?)
• Proving the Rearrangeability of Connecting Networks by Group Calculations
• Title not available (Why is that?)
• A fast parallel algorithm for routing in permutation networks

Cited In (3)

• Title not available (Why is that?)
• The helical cube network
• Title not available (Why is that?)

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)