Stick Graphs with Length Constraints

Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


Stick graphs are intersection graphs of horizontal and vertical line segments that all touch a line of slope -1 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 (STICKA), 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.

Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization. GD 2019
EditorsD. Archambault, C. Tóth
Number of pages15
ISBN (Electronic)978-3-030-35802-0
Publication statusPublished - 2019
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science


  • SIZE

Cite this