Some
Unsolved
Graph Drawing
Problems
by Prof. Nathaniel Dean
|
|
Graph drawings are used throughout the sciences, and because of the enormous variety of constraints there are numerous criteria for a nice drawing of a graph, such as few crossings, small area, symmetry, pattern recognition, and clustering. This talk presents new results and new open problems in these areas related specifically to mathematical programming formulations of crossing number, sphere-of-influence graphs, and rational distances.
Thur. 31st
March 2011
pizza at 6:30 in LC 410
seminar at 7pm in LC 412
|
Prof. Dean is a mathematics professor
at Texas State University, San Marcos.
His research interests
include: discrete mathematics, optimization, data mining, and network visualization.
He is also President of the
National Association of Mathematicians,
which supports minority mathematicians
(particularly, African-Americans).
For more information visit us on
FaceBook and at
http://www.math.sc.edu/~pme/ .
|