In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly 90∘, where the number of bends on such polylines is typically restricted in some way. While structural and topological properties of RAC drawings have been the focus of extensive research, little was known about the boundaries of tractability for computing such drawings. In this paper, we initiate the study of RAC drawings from the viewpoint of parameterized complexity. In particular, we establish that computing a RAC drawing of an input graph G with at most b bends (or determining that none exists) is fixed-parameter tractable parameterized by either the feedback edge number of G, or b plus the vertex cover number of G.
@article{arxiv.2308.10600,
title = {Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs},
author = {Cornelius Brand and Robert Ganian and Sebastian Röder and Florian Schager},
journal= {arXiv preprint arXiv:2308.10600},
year = {2023}
}