Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
From MaRDI portal
Publication:1392529
DOI10.1016/S0166-218X(97)00105-4zbMath0901.68009MaRDI QIDQ1392529
Paraskevi Fragopoulou, Selim G. Akl
Publication date: 28 July 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of graph theory to circuits and networks (94C15)
Related Items (5)
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Complete rotations in Cayley graphs ⋮ Gossiping and routing in undirected triple-loop networks ⋮ Uniform emulations of Cartesian-product and Cayley graphs ⋮ Rotational circulant graphs
Cites Work
- Unnamed Item
- Spanning subgraphs with applications to communication on the multidimensional torus network
- Algebra for computer science
- Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
- Methods and problems of communication in usual networks
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- A survey of gossiping and broadcasting in communication networks
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Optimum broadcasting and personalized communication in hypercubes
This page was built for publication: Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
