New methods for using Cayley graphs in interconnection networks

DOI10.1016/0166-218X(92)90127-VMaRDI QIDQ1199417zbMATH OpenFDO

Authors Gene Cooperman, Larry Finkelstein

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0166-218X(92)90127-V

zbMATH Keywords

algorithmCayley graphscomputational group theoryinterconnection networksSchreier coset graphs

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Theory and Applications of Models of Computation
• Two families of Cayley graph interconnection networks
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Trivalent Cayley graphs for interconnection networks
• Processor interconnection networks from Cayley graphs
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
• scientific article; zbMATH DE number 1054728
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles

Cites work

• A compact representation for permutation groups
• A New Base Change Algorithm for Permutation Groups
• A strong generating test and short presentations for permutation groups
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• Construction of defining relators for finite groups
• Group Action Graphs and Parallel Architectures
• scientific article; zbMATH DE number 4108985 (Why is no real title available?)
• scientific article; zbMATH DE number 3702903 (Why is no real title available?)
• scientific article; zbMATH DE number 43246 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• Systems of reductions

Cited in

(43)

• Application of coding theory to interconnection networks
• Processor interconnection networks from Cayley graphs
• Characterization of \(c\)-circulant digraphs of degree two which are circulant
• Task assignment in Cayley interconnection topologies
• Low time complexity algorithms for path computation in Cayley graphs
• Cayley fuzzy graphs on the fuzzy groups
• Using semidirect products of groups to build classes of interconnection networks
• About some robustness and complexity properties of G-graphs networks
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
• Minimal sense of direction in regular networks
• Absorption Cayley graph
• scientific article; zbMATH DE number 4200233 (Why is no real title available?)
• Thek-degree Cayley graph and its topological properties
• Proof Pearl: Revisiting the Mini-rubik in Coq
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• A group-theoretic model for symmetric interconnection networks
• Representations and routing for Cayley graphs (computer networks)
• scientific article; zbMATH DE number 475367 (Why is no real title available?)
• Gossiping and routing in second-kind Frobenius graphs
• Representations of Borel Cayley Graphs
• scientific article; zbMATH DE number 1054728 (Why is no real title available?)
• Class-congruence property and two-phase routing of Borel Cayley graphs
• Cayley graphs
• Exposing graph uniformities via algebraic specification
• scientific article; zbMATH DE number 861429 (Why is no real title available?)
• Optimal layout of trivalent Cayley interconnection networks
• scientific article; zbMATH DE number 975342 (Why is no real title available?)
• A new class of interconnection networks based on the alternating group
• Routing permutations on a graph
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Theory and Applications of Models of Computation
• A survey on the Intersection graphs of ideals of rings
• Concurrent flows and packet routing in Cayley graphs (Preliminary version)
• The extendability of Cayley graphs generated by transpositions
• A linear algorithm for the distance in Cayley graph \(H_{\ell,p}\)
• Trivalent Cayley graphs for interconnection networks
• Cayley digraphs of direct products of finite simple groups with out-valency two
• Rotational circulant graphs
• Bipancyclic properties of Cayley graphs generated by transpositions

This page was built for publication: New methods for using Cayley graphs in interconnection networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199417)