Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Graph Reconstruction and Verification
Speaker:Hang Zhou
coming from:Ecole Normale Superieure de Paris, Computer Science Department
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Thursday, 26 February 2015
Duration:45 Minutes
Building:E1 4
We study the problem of reconstructing a hidden graph, which can only be accessed by querying pairs of vertices and getting their shortest path or their distance in the graph. We wish to design algorithms with small query complexity. We also study approximate reconstruction.
Further, we explore the verification problem, in which we are given a hypothetical graph and wish to verify that the graph is correct using few queries.
We make progress on those problems for graphs of bounded degree, outerplanar graphs, and graphs of bounded treewidth.

(Joint work with Claire Mathieu and partly with Sampath Kannan)
Name(s):Christina Fries
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Christina Fries, 02/10/2015 10:44 AM
  • Christina Fries, 02/09/2015 11:20 AM
  • Christina Fries, 02/09/2015 11:19 AM -- Created document.