A note on the size of query trees
classification
💻 cs.DS
keywords
queryconstantsizetreesboundedconsiderdegreeexpectation
read the original abstract
We consider query trees of graphs with degree bounded by a constant, $d$. We give simple proofs that the size of a query tree is constant in expectation and $2^{O(d)}\log{n}$ w.h.p.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.