Campus Event Calendar
Event Entry
New for: D3
What and Who
Hamilton cycles in the random geometric graph
Xavier Pérez Giménez
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 3, AG 5, SWS, AG 4, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 29 March 2011
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Random geometric graphs constitute an important family of random graphs in which vertices are scattered at random over some domain and edges are placed between any two vertices within a given distance. These graphs have recently attracted the attention of many researchers, as they provide a theoretical model for some types of wireless networks. In particular, there have been several authors studying the existence of Hamilton cycles in a random geometric graph. In this talk, we survey some of these works along with some related results.
Contact
Xavier Perez Gimenez
--email hidden
passcode not visible
logged in users only
Xavier Perez Gimenez, 03/22/2011 17:14 -- Created document.