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

butterfly networkCayley graphcube-connected cycles networksde Bruijn networkgraph embeddinggroup action graphinterconnection networknetwork simulationparallel architecturesshiffle-exchange network

Mathematics Subject Classification ID

Graph theory (05C99) Theory of software (68N99) 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)

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

(59)

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

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)