Campus Event Calendar
Event Entry
What and Who
Voronoi diagram of lattices under a simplicial distance function and its relation to graphs
Madhusudan Manjunath
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG1
AG 1, AG 4, RG1, MMCI, AG 3, AG 5, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 24 April 2009
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
For an undirected connected graph, we associate a lattice, that we call the Laplacian lattice of the graph. We describe the Voronoi diagram of this lattice under a certain simplicial distance function and show that the properties of this Voronoi diagram can be used to derive structural results on graphs. For ex. Riemann-Roch theorem for graphs. We also discuss some applications to algorithmic and classification problems.
Joint Work with Omid Amini.
Joint Work with Omid Amini.
Contact
Madhusudan Manjunath
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Lattices, Voronoi digrams, Graph Theory.
Madhusudan Manjunath, 04/19/2009 23:38
Madhusudan Manjunath, 04/19/2009 23:36 -- Created document.
Madhusudan Manjunath, 04/19/2009 23:36 -- Created document.