The following pages link to Gengchun Xu (Q1727392):
Displayed 3 items.
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs (Q3459900) (← links)