Group Action Graphs and Parallel Architectures

DOI10.1137/0219037MaRDI QIDQ3476285zbMATH OpenOpenAlexFDO

Authors Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg

Publication date 1990

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0219037

zbMATH Keywords

network simulationCayley graphbutterfly networkgraph embeddinginterconnection networkde Bruijn networkparallel architecturesgroup action graphcube-connected cycles networksshiffle-exchange network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Graph theory (05C99) Theory of software (68N99)

Recommendations

• scientific article; zbMATH DE number 861429
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Exposing graph uniformities via algebraic specification
• Processor interconnection networks from Cayley graphs

Cited in

(57)

• On the pagenumber of trivalent Cayley graphs
• Factorization of de Bruijn digraphs by cycle-rooted trees
• On the strictness of a bound for the diameter of Cayley graphs generated by transposition trees
• On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one
• Fully symmetric swapped networks based on bipartite cluster connectivity
• scientific article; zbMATH DE number 1990688 (Why is no real title available?)
• Connectedness of two-sided group digraphs and graphs
• Gossiping and routing in second-kind Frobenius graphs
• An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• Two-sided group digraphs and graphs
• Cycles in butterfly graphs
• Containment of butterflies in networks constructed by the line digraph operation
• Broadcasting in butterfly and deBruijn networks
• scientific article; zbMATH DE number 4080873 (Why is no real title available?)
• scientific article; zbMATH DE number 1444282 (Why is no real title available?)
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Towards worst-case churn resistant peer-to-peer systems
• Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
• The shuffle exchange network has a Hamiltonian path
• Labelings in Cayley digraphs
• Action graph of a semigroup act & its functorial connection
• Broadcasting in butterfly and deBruijn networks (extended abstract)
• Rotational circulant graphs
• New methods for using Cayley graphs in interconnection networks
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• Absorption Cayley graph
• Cycles in the cube-connected cycles graph
• Minimum spanners of butterfly graphs
• Derangement action digraphs and graphs
• Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
• A unified framework for off-line permutation routing in parallel networks
• Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks
• A note on cyclic-cubes
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• On the diameter and bisector size of Cayley graphs
• On quasi-Cayley graphs
• Algebraic specification of interconnection network relationships by permutation voltage graph mappings
• Broadcasting in the butterfly network
• Group graphs and computational symmetry on massively parallel architecture
• Shuffle ring network based on group theory
• Exposing graph uniformities via algebraic specification
• scientific article; zbMATH DE number 2185572 (Why is no real title available?)
• Large butterfly Cayley graphs and digraphs
• Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
• Characteristic polynomials of digraphs having a semi-free action
• The shuffle exchange network has a Hamiltonian path
• Cycles in cube-connected cycles graphs
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• Self-spanner graphs
• Cayley graphs as models of deterministic small-world networks
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
• Cayley graphs of groupoids and generalized fat-trees
• A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
• A note on recursive properties of the de Bruijn, Kautz and FFT digraphs
• On routing and diameter of metacyclic graphs

This page was built for publication: Group Action Graphs and Parallel Architectures

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