Skip to Main content Skip to Navigation
New interface

Graph algorithms : network inference and planar graph optimization

Abstract : This thesis focuses on two topics of graph algorithms. The first topic is network inference. How efficiently can we find an unknown graph using shortest path queries between its vertices? We assume that the graph has bounded degree. In the reconstruction problem, the goal is to find the graph; and in the verification problem, the goal is to check whether a given graph is correct. We provide randomized algorithms based on a Voronoi cell decomposition. Next, we analyze greedy algorithms, and show that they are near-optimal. We also study the problems on special graph classes, prove lower bounds, and study the approximate reconstruction. The second topic is optimization in planar graphs. We study two problems. In the correlation clustering problem, the input is a weighted graph, where every edge has a label of h+i or h−i, indicating whether its endpoints are in the same category or in different categories. The goal is to find a partition of the vertices into categories that tries to respect the labels. In the two-edge-connected augmentation problem, the input is a weighted graph and a subset R of edges. The goal is to produce a minimum-weight subset S of edges, such that for every edge in R, its endpoints are two-edge-connected in the union of R and S. For planar graphs, we reduce correlation clustering to two-edge-connected augmentation, and show that both problems, although they are NP-hard, have a polynomial-time approximation scheme. We build on the brick decomposition technique developed recently.
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Friday, April 20, 2018 - 2:09:09 PM
Last modification on : Friday, June 24, 2022 - 3:10:58 AM
Long-term archiving on: : Tuesday, September 18, 2018 - 6:25:27 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01174514, version 2



Hang Zhou. Graph algorithms : network inference and planar graph optimization. Computational Geometry [cs.CG]. Ecole normale supérieure - ENS PARIS, 2015. English. ⟨NNT : 2015ENSU0016⟩. ⟨tel-01174514v2⟩



Record views


Files downloads