Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs
Discrete & Computational Geometry
Note: On the maximum number of edges in quasi-planar graphs
Journal of Combinatorial Theory Series A
Drawing Graphs with Right Angle Crossings
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Notes on large angle crossing graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
On the size of graphs that admit polyline drawings with few bends and crossing angles
GD'10 Proceedings of the 18th international conference on Graph drawing
Area, curve complexity, and crossing resolution of non-planar graph drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
On the perspectives opened by right angle crossing drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
Right angle crossing graphs and 1-planarity
GD'11 Proceedings of the 19th international conference on Graph Drawing
Drawing cubic graphs with the four basic slopes
GD'11 Proceedings of the 19th international conference on Graph Drawing
Drawing graphs with vertices at specified positions and crossings at large angles
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Heuristics for the maximum 2-layer RAC subgraph problem
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Vertex angle and crossing angle resolution of leveled tree drawings
Information Processing Letters
Graphs That Admit Polyline Drawings with Few Crossing Angles
SIAM Journal on Discrete Mathematics
Right angle crossing graphs and 1-planarity
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5n and 74.2n, respectively. This is a strengthening of a recent result of Didimo et al.