Constant query time (1 + ϵ)-approximate distance oracle for planar graphs

Theoretical Computer Science ◽

10.1016/j.tcs.2018.08.024 ◽

2019 ◽

Vol 761 ◽

pp. 78-88

Author(s):

Qian-Ping Gu ◽

Gengchun Xu

Keyword(s):

Planar Graphs ◽

Query Time ◽

Approximate Distance ◽

Distance Oracle

Download Full-text

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

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-662-48971-0_53 ◽

2015 ◽

pp. 625-636 ◽

Cited By ~ 3

Author(s):

Qian-Ping Gu ◽

Gengchun Xu

Keyword(s):

Planar Graphs ◽

Query Time ◽

Approximate Distance ◽

Distance Oracle

Download Full-text

Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611974331.ch26 ◽

2015 ◽

Cited By ~ 4

Author(s):

Christian Wulff-Nilsen

Keyword(s):

Planar Graphs ◽

Query Time ◽

Time Space ◽

Distance Oracles ◽

Approximate Distance

Download Full-text

Approximate Distance Oracles with Improved Query Time

Encyclopedia of Algorithms ◽

10.1007/978-3-642-27848-8_568-1 ◽

2014 ◽

pp. 1-4

Author(s):

Christian Wulff-Nilsen

Keyword(s):

Query Time ◽

Distance Oracles ◽

Approximate Distance

Download Full-text

Approximate distance oracles with constant query time

Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14 ◽

10.1145/2591796.2591801 ◽

2014 ◽

Cited By ~ 21

Author(s):

Shiri Chechik

Keyword(s):

Query Time ◽

Distance Oracles ◽

Approximate Distance

Download Full-text

A compact routing scheme and approximate distance oracle for power-law graphs

ACM Transactions on Algorithms ◽

10.1145/2390176.2390180 ◽

2012 ◽

Vol 9 (1) ◽

pp. 1-26 ◽

Cited By ~ 9

Author(s):

Wei Chen ◽

Christian Sommer ◽

Shang-Hua Teng ◽

Yajun Wang

Keyword(s):

Power Law ◽

Compact Routing ◽

Routing Scheme ◽

Approximate Distance ◽

Distance Oracle

Download Full-text

Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15612-5_9 ◽

2015 ◽

pp. 89-100

Author(s):

Gaurav Singh ◽

N. S. Narayanaswamy ◽

G. Ramakrishna

Keyword(s):

Chordal Graphs ◽

Approximate Distance ◽

Distance Oracle

Download Full-text

Approximate Distance Oracles with Improved Query Time

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973105.39 ◽

2013 ◽

Cited By ~ 11

Author(s):

Christian Wulff-Nilsen

Keyword(s):

Query Time ◽

Distance Oracles ◽

Approximate Distance

Download Full-text

Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

Theory of Computing Systems ◽

10.1007/s00224-019-09949-5 ◽

2019 ◽

Vol 63 (8) ◽

pp. 1849-1874

Author(s):

Itay Laish ◽

Shay Mozes

Keyword(s):

Planar Graphs ◽

Distance Oracles ◽

Approximate Distance

Download Full-text

Approximate Distance Oracles with Improved Query Time

Encyclopedia of Algorithms ◽

10.1007/978-1-4939-2864-4_568 ◽

2016 ◽

pp. 94-97

Author(s):

Christian Wulff-Nilsen

Keyword(s):

Query Time ◽

Distance Oracles ◽

Approximate Distance

Download Full-text

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels

Proceedings of the 44th symposium on Theory of Computing - STOC '12 ◽

10.1145/2213977.2214084 ◽

2012 ◽

Cited By ~ 7

Author(s):

Ittai Abraham ◽

Shiri Chechik ◽

Cyril Gavoille

Keyword(s):

Planar Graphs ◽

Distance Oracles ◽

Approximate Distance ◽

Forbidden Set ◽

Set Distance

Download Full-text

Constant query time (1 + ϵ)-approximate distance oracle for planar graphs

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

Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff

Approximate Distance Oracles with Improved Query Time

Approximate distance oracles with constant query time

A compact routing scheme and approximate distance oracle for power-law graphs

Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs

Approximate Distance Oracles with Improved Query Time

Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

Approximate Distance Oracles with Improved Query Time

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels

Constant query time (1 + ϵ)-approximate distance oracle for planar graphs