Colloquium Announcement
Department of Mathematics
West Virginia University
for
Thursday, April 23, 1998, at 3:45pm
in 324 Armstrong Hall
(Tea and cookies begin at 3:00 in coffee room.)
Professor Chen Zhao
Indiana State University
Extremal n-colorable subgraphs with restrictions
The talk will be suitable for a general audience.
Students are strongly encouraged to participate.
Abstract
Programming distributed-memory machine requires
partitioning of the program data structures and
distributing of them to the local storage of each
individual processor.
It is important to address the issue of reducing
data movement between processors due
to cross-reference among different
distributive arrays.
Solving this issue can be
viewed as finding the optimum solution of
partitioning the vertex set of
a weighted graph under some restrictions.
This talk will address structural as well as algorithmic issues
for obtaining better approximate solutions.
The information on the future (and past) Colloquia can be also found on web at the
address:
http://www.math.wvu.edu/homepages/kcies/colloquium.html