Complexity results for three-dimensional orthogonal graph drawing-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Complexity results for three-dimensional orthogonal graph drawing

Published:2008-03 Issue:1 Volume:6 Page:140-161
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Patrignani Maurizio

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference35 articles.

1. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall;Inform. Process. Lett.,1979

2. The complexity of minimizing wire lengths in VLSI layouts;Bhatt;Inform. Process. Lett.,1987

3. T.C. Biedl, Heuristics for 3D-orthogonal graph drawings, in: Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, 1995, pp. 41–44

4. A note on 3D orthogonal graph drawing;Biedl;Discrete Appl. Math.,2005

5. Graph Theory with Applications;Bondy,1976

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

1. Aesthetics and comprehension of curved 3D graphs in Virtual Reality;Journal of Computer Languages;2023-06

2. Polygons with Prescribed Angles in 2D and 3D;Lecture Notes in Computer Science;2020

3. Pixel and Voxel Representations of Graphs;Lecture Notes in Computer Science;2015

4. The Shape of Orthogonal Cycles in Three Dimensions;Discrete & Computational Geometry;2011-11-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP