Author:
Leighton Tom,Moitra Ankur
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference10 articles.
1. Barnette, D.: Trees in polyhedral graphs. Can. J. Math. 18, 731–736 (1966)
2. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7, 609–616 (2001)
3. Dhandapani, R.: Greedy drawings of triangulations. In: Symposium on Discrete Algorithms, pp. 102–111 (2008)
4. Eppstein, D., Goodrich, M.T.: Succinct greedy graph drawing in the hyperbolic plane. In: Graph Drawing, pp. 14–25 (2008)
5. Gao, Z., Richter, R.: 2-walks in circuit graphs. J. Comb. Theory Ser. B 62, 259–267 (1994)
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Angles of arc-polygons and Lombardi drawings of cacti;Computational Geometry;2023-06
2. Drawing Graphs as Spanners;Discrete & Computational Geometry;2022-06-06
3. On the plane angle-monotone graphs;Computational Geometry;2022-01
4. Angle-monotonicity of Delaunay triangulation;Computational Geometry;2021-03
5. Balance Transfers and Bailouts in Credit Networks using Blockchains*;2020 IEEE International Conference on Blockchain and Cryptocurrency (ICBC);2020-05