Triangle Computer Science Distinguished Lecturer Series
Monday, March 3, 2014, 4:00pm, D106 LSRC, Duke
Laszlo Lovasz (Eötvös Loránd University)
Geometric representations of graphs
Abstract:- o represent a graph by a nice geometric picture is a
natural goal in itself, but in addition it is an important
tool in the study of various graph properties and in the
design of graph algorithms. We survey several forms of this
interplay between graph algorithms and geometry: algorithms
for perfect graphs, maximum cut, connectivity, bandwidth. We
discuss how to use a representation obtained from the
adjacency matrix to compute an almost optimal weak
regularity partition in constant time in the property
testing model.
For more info :
Triangle Computer Science Distinguished Lecturer Series
Generated at 6:10am Friday, April 19, 2024 by Mcal. Top
* Reload
* Login