|
The Department of Computer Science Colloquium Series is generally scheduled for 3:45 p.m. - 5:00 p.m. on
Wednesdays or Fridays, in the Math & Computer Science Building, Room 228.
Directions to our building are available.
The Department of Computer Science maintains a mailing list for colloquia announcements. If you are interested in receiving
emails when a colloquium is scheduled, please subscribe to the CS Colloquium Mailing List.
You may unsubscribe at any time.
Colloquium for Friday, February 20, 2009
| Speaker: |
Dr. Vitaly I. Voloshin, Department of Mathematics, Physics, Computer Science and Geomatics, Troy University, Troy, AL
|
| Title: |
Graph Coloring: history, generalizations, algorithms and open problems.
|
| Abstract: |
For the last 50 years, Computer Science became a major provider of
problems to Graph Theory and, simultaneously, it became a major consumer of
the solutions to such problems.
Graph Coloring is the core of Graph Theory with many fundamental results and
open problems. Especially rapidly are developing research related to
hypergraph generalizations of graph coloring. Hypergraph is a collection of
subsets of a given vertex set. Subsets are called hyperedges. Hypergraph
coloring is a partition of the vertex set of a hypergraph satisfying some
general constraints on hyperedges. I will give a survey talk on coloring of
the so called mixed hypergraphs. I will discuss some models, algorithms and
open problems concerning uncolorability, unique colorability, and
perfection.
Some information related to my talk may be found on the Mixed Hypergraph
Coloring website maintained at http://spectrum.troy.edu/~voloshin/mh.html
or
searching by Google for "mixed hypergraph".
Short Bio: Vitaly Voloshin is a professor at the Department of Mathematics,
Physics, Computer Science and Geomatics, Troy University.
He worked at Moldova State University and at the Institute
of Mathematics and Informatics of the Moldovan Academy of Sciences
(Republic of Moldova, former Soviet Union) for many years, and
moved to the United States in 2002.
His research areas include graph and hypergraph coloring, theory, algorithms and
applications. In 1993, he originated the direction of
mixed hypergraph coloring and his work has appeared in more than 180 scientific
publications, including research Fields Institute Monograph. His
research has been repeatedly supported by many scientific foundations of Italy,
Germany, Canada, the United States, and other countries. He was the invited speaker
of 12 major international conferences, held visiting positions at
many universities throughout the world, and supervised and was consulted on many MS and PhD Theses. He is the author of two textbooks for math and computer science majors: "Introduction to Graph Theory" and "Introduction to Graph and Hypergraph Theory.
http://spectrum.troy.edu/~voloshin/
Hosts: Feodor F. Dragan
|
| Time: |
Friday, February 20, 2009, 3:45 - 5:00 PM
|
| Place: |
MSB, Room 228
|
 |
Other Colloquia Scheduled for Spring 2009
| |
| |
| |
- Wednesday April 1, 2009
Computational Thinking
Dr. Jeannette M. Wing, President's Professor of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Assistant Director, CISE Directorate, National Science Foundation
3:45 - 5:00 PM MSB, Room 228
|
| |
- Wednesday April 15, 2009
Graph sandwich problems
Dr. R. Sritharan, The University of Dayton, Dayton, Ohio
3:45 - 5:00 PM MSB, Room 228
|
| |
| |
Return to Current Colloquia
|
