Gao–Zhang well-separated pair decomposition problem for unit-disk graphs
This entry tracks Gao–Zhang well-separated pair decomposition problem for unit-disk graphs.
It determines the asymptotically optimal decomposition size for this geometric graph class.
Latest development
The preprint obtains O(n ε⁻² log(1/ε)) decompositions and matching worst-case lower bounds.
Editorial caveat
The complete resolution is currently supported only by the primary preprint.
References
- A Well-Separated Pair Decomposition of Linear Size for Unit-Disk Graphs — arXiv — Mark de Berg, Joachim Gudmundsson, Sampson Wong
Source: arXiv
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.