Succinct Greedy Graph Drawing in the Hyperbolic Plane-Reference-Cited by-同舟云学术

Succinct Greedy Graph Drawing in the Hyperbolic Plane

Published:2009 Issue: Volume: Page:14-25
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Eppstein David,Goodrich Michael T.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00219-9_3

Reference21 articles.

1. Lecture Notes in Computer Science;S. Alstrup,1997

2. Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wireless Networks 6(7), 609–616 (2001)

3. Chen, M.B., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates. In: Proc. 23rd Symp. Computational Geometry (SoCG 1997), pp. 210–219 (1997)

4. Dhandapani, R.: Greedy drawings of triangulations. In: Proc. 19th ACM-SIAM Symp. Discrete Algorithms (SODA 2008), pp. 102–111 (2008)

5. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Connected Hyperbolic Complex Networks;2022 International Conference on Computational Science and Computational Intelligence (CSCI);2022-12

2. Every Schnyder drawing is a greedy embedding;Theoretical Computer Science;2020-02

3. Greedy Embedding Strategy for Dynamic Graphs Based on Spanning Tree;Cloud Computing and Security;2018

4. Succinct and practical greedy embedding for geometric routing;Computer Communications;2017-12

5. Compact Conformal Map for Greedy Routing in Wireless Mobile Sensor Networks;IEEE Transactions on Mobile Computing;2016-07-01