Routing and gossiping in Frobenius graphs
by Dr Sanming Zhou
Abstract: What graphs should we use to model interconnection networks in order to achieve high performance? Of course the answer to this question depends on how we measure performance of a network. In this talk we will focus on performance of a network with respect to routing and gossiping. We will show that certain Cayley graphs over
Frobenius groups admit "perfect" routing and gossiping schemes in some sense.
In a subsequent ORSUM seminar Alison Thomson will talk about Frobenius multi-loop networks.
For More Information: Dr Mark Fackrell M.Fackrell@ms.unimelb.edu.au