cs860 Lectures (send me email if you want to access these -- if you were in class you heard the algorithm!)
Time and Place: Monday and Friday, 12:00 - 1:30,
MC 2036 (the bigger of the two),
starting Friday January 9.
This course is about representing graphs geometrically. The emphasis will be on algorithms and on clean mathematical results. Given some geometric structure, such as visibility among objects in the plane, or "closeness" of points in the plane, which graphs can be captured that way? How hard is it to find such a representation for a graph?
Format: This is a research level seminar course. Everyone will be expected to present papers, come up with open problems, and work at solving them.
Background: I will assume a background in algorithms, data structures, and graph theory at a decent undergraduate level. You can take this course whether or not you have taken CS 762 (taught by Therese Biedl in F08).
Credit: Grades will be given based on class presentations (60%), participation in suggesting problems (20%), and your work on solving problems (20%). Group work is encouraged. Publishable work is the goal, though you can get an excellent grade without that.
Topics: (Tentative list)