English

A note on the size of query trees

Data Structures and Algorithms 2017-08-03 v1

Abstract

We consider query trees of graphs with degree bounded by a constant, dd. We give simple proofs that the size of a query tree is constant in expectation and 2O(d)logn2^{O(d)}\log{n} w.h.p.

Cite

@article{arxiv.1708.00510,
  title  = {A note on the size of query trees},
  author = {Shai Vardi},
  journal= {arXiv preprint arXiv:1708.00510},
  year   = {2017}
}
R2 v1 2026-06-22T21:04:07.874Z