A theory of decomposition into prime factors of layered interconnection networks

DOI10.1016/j.dam.2010.03.014zbMath1213.05218OpenAlexW2023375168MaRDI QIDQ531607

Azaria Paz

Publication date: 19 April 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.03.014

zbMATH Keywords

graph decompositiongraph cross-productlayered interconnection networksprime graph factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Intuitionistic Layered Graph Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Local algorithms for the prime factorization of strong product graphs
• A unified theory of interconnection network structure
• A graph theoretical approach to equivalence of multistage interconnection networks
• Quad trees: A data structure for retrieval by composite keys
• Efficient algorithms for checking the equivalence of 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
• An O (log N ) deterministic packet-routing scheme
• Layered cross product&mdashA technique to construct interconnection networks
• Data Manipulating Functions in Parallel Processors and Their Implementations
• On the Rearrangeability of 2(Iog₂N) –1 Stage Permutation Networks
• Permutation Groups, Complexes, and Rearrangeable Connecting Networks
• A Permutation Network

This page was built for publication: A theory of decomposition into prime factors of layered interconnection networks