A better heuristic for orthogonal graph drawings-Reference-Cited by-同舟云学术

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

A better heuristic for orthogonal graph drawings

Published:1998-02 Issue:3 Volume:9 Page:159-180
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Biedl Therese,Kant Goos

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference27 articles.

1. New lower bounds for orthogonal graph drawing;Biedl,1996

2. Optimal orthogonal drawings of triconnected plane graphs;Biedl,1996

3. Improved orthogonal drawings of 3-graphs;Biedl,1996

4. Optimal orthogonal drawings of connected plane graphs;Biedl,1996

5. A linear algorithm for embedding planar graphs using PQ-trees;Chiba;J. Comput. System Sci.,1985

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

1. On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity;Algorithmica;2024-08-04

2. Proper colorability of segment intersection graphs;Journal of Combinatorial Optimization;2024-05

3. Kernelization for feedback vertex set via elimination distance to a forest;Discrete Applied Mathematics;2024-03

4. Semi-total Domination in Unit Disk Graphs;Lecture Notes in Computer Science;2024

5. Algorithmic aspects of secure domination in unit disk graphs;Information and Computation;2023-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP