Testing gap k-planarity is NP-complete-Reference-Cited by-同舟云学术

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

Testing gap k-planarity is NP-complete

Published:2021-08 Issue: Volume:169 Page:106083
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Urschel John C.^ORCID,Wellens Jake

Funder

Office of Naval Research

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference26 articles.

1. Algorithms for drawing graphs: an annotated bibliography;Di Battista;Comput. Geom.,1994

2. Graph Drawing: Algorithms for the Visualization of Graphs;Battista,1998

3. Drawing Graphs: Methods and Models, vol. 2025;Kaufmann,2003

4. Effective information visualisation: a study of graph drawing aesthetics and algorithms;Purchase;Interact. Comput.,2000

5. Empirical evaluation of aesthetics-based graph layout;Purchase;Empir. Softw. Eng.,2002

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

1. Weak-Dynamic Coloring of Graphs Beyond-Planarity;Graphs and Combinatorics;2023-12-23

2. Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth;Lecture Notes in Computer Science;2023

3. Recognizing and Embedding Simple Optimal 2-Planar Graphs;Lecture Notes in Computer Science;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP