A graph theoretical approach to equivalence of multistage interconnection networks

DOI10.1016/0166-218X(88)90096-0zbMath0672.05036OpenAlexW2005491469MaRDI QIDQ1119597

Alain Jean-Marie, Jean-Claude Bermond, Jean-Michel Fourneau

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90096-0

zbMATH Keywords

directed graphstopological equivalencemultistage interconnection networksbaseline network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks ⋮ A theory of decomposition into prime factors of layered interconnection networks

Cites Work

• A unified theory of interconnection network structure
• Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
• On a Class of Multistage Interconnection Networks
• Access and Alignment of Data in an Array Processor
• The Indirect Binary n-Cube Microprocessor Array
• Data Manipulating Functions in Parallel Processors and Their Implementations

This page was built for publication: A graph theoretical approach to equivalence of multistage interconnection networks