Theoretical Computer Science
An Alternative Method to Crossing Minimization on Hierarchical Graphs
SIAM Journal on Optimization
Notes on large angle crossing graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Graphs that admit right angle crossing drawings
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
The quality ratio of RAC drawings and planar drawings of planar graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
2-Layer right angle crossing drawings
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
| Hi-index | 0.00 |
This paper studies 2-layer RAC drawings of bipartite graphs. The contribution is as follows: (i) We prove that the problem of computing the maximum 2-layer RAC subgraph is NP-hard even when the vertex ordering on one layer is fixed; this extends a previous NP-hardness result that allows the vertices to be permuted on each layer. (ii) We describe a 3-approximation algorithm for the maximum 2-layer RAC subgraph problem when the vertex ordering on each layer is not fixed, and a heuristic for the case that the vertex ordering on one of the layers is fixed. (iii) We present an experimental study that evaluates the effectiveness of the proposed approaches.