Gengchun Xu

According to our database, Gengchun Xu authored at least 4 papers between 2014 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

Constant query time (1 + <i>ϵ</i>)-approximate distance oracle for planar graphs.

Qian-Ping Gu, Gengchun Xu

Theor. Comput. Sci., 2019

2017

Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs.

Qian-Ping Gu, Gengchun Xu

CoRR, 2017

2015

Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs.

Qian-Ping Gu, Gengchun Xu

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs.

Qian-Ping Gu, Gengchun Xu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014