By Topic

Dense symmetric networks from linear groups

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

8 Author(s)
L. Campbell ; Dept. of Comput. Sci., Idaho Univ., ID, USA ; M. Fellows ; G. Carlsson ; V. Faber
more authors

An algebraic approach to the problem of constructing large networks of bounded degree and diameter is described. Evidence is provided showing that the table of largest known constructions for small values of the two parameters can be improved almost everywhere by methods based on finite groups. In many entries, the constructions are dramatically larger than the best previously known and many of these improvements are in the range of numbers of processors currently being considered for large parallel processing systems. These contributions, all highly symmetric, can be viewed as belonging to a family of constructions based on vector spaces and their automorphism groups that includes hypercubes and cube-connected cycles as special cases

Published in:

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Date of Conference:

10-12 Oct 1988