A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
On the Size of Outer-String Representations
2018
Scandinavian Workshop on Algorithm Theory
Outer-string graphs, i.e., graphs that can be represented as intersection of curves in 2D, all of which end in the outer-face, have recently received much interest, especially since it was shown that the independent set problem can be solved efficiently in such graphs. However, the runtime for the independent set problem depends on N , the number of segments in an outer-string representation, rather than the number n of vertices of the graph. In this paper, we argue that for some outer-string
doi:10.4230/lipics.swat.2018.10
dblp:conf/swat/BiedlBD18
fatcat:phzzwx3ohbdl7loiwpiucfipxq