By Topic

Group graphs and computational symmetry on massively parallel architecture

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

1 Author(s)

Group graphs are used to implement and reduce routing time in a domain whose associated operators are invariant under a group of invariances in a massively parallel environment. The algorithms are implemented in a program that solves chess endgames, part of whose space is invariant under a noncommutative crystallographic group

Published in:

Supercomputing '90., Proceedings of

Date of Conference:

12-16 Nov 1990