Campus Event Calendar
Event Entry
What and Who
Traversing large graphs in realistic settings
Deepak Ajwani
Max-Planck-Institut für Informatik - D1
Promotionskolloquium
AG 1, AG 5
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Sunday, 21 December 2008
11:00
60 Minutes
E1 4
024
Saarbrücken
Abstract
The notion of graph traversal is of fundamental importance to solving many computational problems. In many modern applications involving graph traversal such as those arising in the domain of social networks, Internet based services, fraud detection in telephone calls etc., the underlying graph is very large and dynamically evolving. This dissertation deals with the design and engineering of traversal algorithms for such graphs.
Contact
Deepak Ajwani
--email hidden
passcode not visible
logged in users only
Deepak Ajwani, 12/17/2008 00:17 -- Created document.