Area-efficient algorithms for upward straight-line tree drawings
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/3-540-61332-3_143
Reference14 articles.
1. P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Computational Geometry: Theory and Applications, pages 187–200, 1992.
2. P. Crescenzi and A. Piperno. Optimal-area upward drawings of AVL trees. In R. Tamassia and I.G. Tollis, editors, Proc. Graph Drawing: DIMACS international workshop, GD'94, volume 894 of LNCS, pages 307–317. Springer Verlag, 1994.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235–282, 1994.
4. A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. 9th Annu. ACM Sympo. Comput. Geom., pages 359–368, 1993.
5. H. Gazit, G.L. Miller, and S-H. Teng. Optimal tree contraction in an EREW model. In S.K. Tewksbury, B.W. Dickinson, and S.C. Schwartz, editors, Concurrent Computations: Algorithms, Architecture and Technology, pages 139–156. Plenum Press, 1988.
Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantifying the Space-Efficiency of 2D Graphical Representations of Trees;Information Visualization;2009-05-21
2. Strictly-upward drawings of ordered search trees;Theoretical Computer Science;1998-08
3. Minimum-area h-v drawings of complete binary trees;Graph Drawing;1997
4. Upward Drawings of Trees on the Minimum Number of Layers;WALCOM: Algorithms and Computation
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3