MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Graph Reconstruction and Verification

Hang Zhou
Ecole Normale Superieure de Paris, Computer Science Department
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI  
AG Audience
English

Date, Time and Location

Thursday, 26 February 2015
13:00
45 Minutes
E1 4
024
Saarbrücken

Abstract

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)

Contact

Christina Fries
--email hidden
passcode not visible
logged in users only

Christina Fries, 02/10/2015 10:44
Christina Fries, 02/09/2015 11:20
Christina Fries, 02/09/2015 11:19 -- Created document.