 |
Center for Nonlinear Studies |
In this talk we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. These graphs arise in the context of parallel computing when determining an optimal linkage of a given collection of processors. A particular class of processor linkages with point-to-point communication links are static interconnection networks, widely used for message-passing architectures.
Host: Stephan Eidenbenz, CCS-3: INFORMATION SCIENCES, eidenben@lanl.gov