On recurrent and recursive interconnection patterns

DOI10.1016/0020-0190(86)90067-0zbMath0595.68059OpenAlexW2055822958MaRDI QIDQ1077935

Ian Parberry

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90067-0

zbMATH Keywords

parallel computationtrivalent graphscube-connected cycleslarge parallel machinesshuffle- exchangesynchronous parallel computers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

An optimal time bound for oblivious routing

Cites Work

• Unnamed Item
• Unnamed Item
• Efficiency of universal parallel computers
• Infinite cube-connected cycles
• Parallel Processing with the Perfect Shuffle