3 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
L. Sunil Chandran, Mathew C Francis, Naveen Sivadasan
We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in 1.5(Δ+2)lnn dimensions, where Δ is the maximum degree of G. We…