• Corpus ID: 249848294

Tight query complexity bounds for learning graph partitions

  title={Tight query complexity bounds for learning graph partitions},
  author={Xizhi Liu and Sayan Mukherjee},
Given a partition of a graph into connected components, the membership oracle asserts whether any two vertices of the graph lie in the same component or not. We prove that for n ≥ k ≥ 2, learning the components of an n -vertex hidden graph with k components requires at least ( k − 1) n − (cid:0) k 2 (cid:1) membership queries. Our result improves on the best known information-theoretic bound of Ω( n log k ) queries, and exactly matches the query complexity of the algorithm introduced by Reyzin… 

Figures from this paper



Learning and Verifying Graphs Using Queries with a Focus on Edge Counting

We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, shortest path), but

A Simple Algorithm for Graph Reconstruction

This work shows that, on random Δ-regular graphs, the reconstruction algorithm based on multi-phase Voronoi-cell decomposition and using O(n^{3/2}) distance queries uses O( n) distance queries, and has a very simple structure, and is highly parallelizable.

Reconstruction and verification of chordal graphs with a distance oracle

Graph Reconstruction and Verification

This work provides a randomized algorithm for reconstruction using Õ(n3/2) distance queries, based on Voronoi cell decomposition, and analyzes natural greedy algorithms for reconstructionUsing a shortest path oracle and also for verification using either oracle, and shows that their query complexity is n1+o(1).

An optimal algorithm to reconstruct trees from additive distance data.

  • J. Hein
  • Computer Science
    Bulletin of mathematical biology
  • 1989

Graph Reconstruction with a Betweenness Oracle

The betweenness oracle is introduced, where bet(a, m, z) is true iff m lies on a shortest path between a and z, and this oracles is strictly weaker than a distance oracle, in the sense that a betweenness query can be simulated by a constant number of distance queries, but not vice versa.

The size of uniquely colorable graphs

  • Shaoji Xu
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1990

Graph Verification with a Betweenness Oracle

The query complexity of verifying a hidden graph G with a betweenness oracle is examined and it is proved that graph verification can be done using n1+o(1) betweenness queries – a matching lower bound.

Planar Separators

The authors give a short proof of a theorem of Lipton and Tarjan, that, for every planar graph with n > 0 vertives, there is a partition (A, B, C,) of its vertex set such that no vertex in A is adjacent to any vertex in B.

A Separator Theorem for Graphs of Bounded Genus