A theory of decomposition into prime factors of layered interconnection networks
From MaRDI portal
Publication:531607
DOI10.1016/J.DAM.2010.03.014zbMATH Open1213.05218OpenAlexW2023375168MaRDI QIDQ531607FDOQ531607
Authors: 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Quad trees: A data structure for retrieval by composite keys
- Title not available (Why is that?)
- The Indirect Binary n-Cube Microprocessor Array
- On a Class of Multistage Interconnection Networks
- Access and Alignment of Data in an Array Processor
- Local algorithms for the prime factorization of strong product graphs
- A Permutation Network
- A unified theory of interconnection network structure
- A graph theoretical approach to equivalence of multistage interconnection networks
- Efficient algorithms for checking the equivalence of multistage interconnection networks
- Title not available (Why is that?)
- 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(Iog2N) –1 Stage Permutation Networks
- Permutation Groups, Complexes, and Rearrangeable Connecting Networks
Cited In (3)
This page was built for publication: A theory of decomposition into prime factors of layered interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531607)
