Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract)-Reference-Cited by-同舟云学术

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

Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract)

Published:1999 Issue: Volume: Page:361-376
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Mutzel Petra,Weiskircher René

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48777-8_27

Reference13 articles.

1. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956–997, October 1996.

2. Lect Notes Comput Sci;P. Bertolazzi,1998

3. D. Bienstock and C. L. Monma. Optimal enclosing regions in planar graphs. Networks, 19(1):79–94, 1989.

4. D. Bienstock and C. L. Monma. On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica, 5(1):93–109, 1990.

5. J. Cai. Counting embeddings of planar graphs using DFS trees. SIAM Journal on Discrete Mathematics, 6(3):335–352, 1993.

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

1. Planar Embeddings with Small and Uniform Faces;Algorithms and Computation;2014

2. Counterexamples in Chemical Ring Perception;Journal of Chemical Information and Computer Sciences;2004-03-01

3. The SPQR-Tree Data Structure in Graph Drawing;Automata, Languages and Programming;2003

4. Bend Minimization in Orthogonal Drawings Using Integer Programming;Lecture Notes in Computer Science;2002

5. A Linear Time Implementation of SPQR-Trees;Graph Drawing;2001

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP