The Straight-Line RAC Drawing Problem Is NP-Hard-Reference-Cited by-同舟云学术

The Straight-Line RAC Drawing Problem Is NP-Hard

Published:2011 Issue: Volume: Page:74-85
ISSN:0302-9743
Container-title:SOFSEM 2011: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

Argyriou Evmorfia N.,Bekos Michael A.,Symvonis Antonios

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18381-2_6

Reference20 articles.

1. Lecture Notes in Computer Science;P. Angelini,2010

2. Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. In: 18th International Symposium on Graph Drawing (2010) (to appear)

3. Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-hard. CoRR abs/1009.5227 (2010)

4. Arikushi, K., Fulek, R., Keszegh, B., Moric, F., Toth, C.: Drawing graphs with orthogonal crossings. In: 36th International Workshop on Graph Theoretic Concepts in Computer Science (2010) (to appear)

5. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)

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

1. Graphs with large total angular resolution;Theoretical Computer Science;2023-01

2. RAC drawings in subcubic area;Information Processing Letters;2020-07

3. Graphs with Large Total Angular Resolution;Lecture Notes in Computer Science;2019

4. Bar 1-Visibility Drawings of 1-Planar Graphs;Applied Algorithms;2014

5. Right angle crossing graphs and 1-planarity;Discrete Applied Mathematics;2013-05