You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs
|
---|---|
Chapter number | 53 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2015
|
DOI | 10.1007/978-3-662-48971-0_53 |
Book ISBNs |
978-3-66-248970-3, 978-3-66-248971-0
|
Authors |
Qian-Ping Gu, Gengchun Xu |