Abstract
Stick graphs are intersection graphs of horizontal and vertical line segments that all touch a line of slope and lie above this line. De Luca et al. [GD’18] considered the recognition problem of stick graphs when no order is given (STICK), when the order of either one of the two sets is given (STICK), and when the order of both sets is given (STICKAB). They showed how to solve STICKAB efficiently. In this paper, we improve the running time of their algorithm, and we solve STICKA efficiently. Further, we consider variants of these problems where the lengths of the sticks are given as input. We show that these variants of STICK, STICKA, and STICKAB are all NP-complete. On the positive side, we give an efficient solution for STICKAB with fixed stick lengths if there are no isolated vertices.
Cite
CITATION STYLE
Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., & Zink, J. (2019). Stick Graphs with Length Constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11904 LNCS, pp. 3–17). Springer. https://doi.org/10.1007/978-3-030-35802-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
