An outersegment graph is the intersection graph of line-segments lying inside a disk and having one end-point on the boundary of the disk. We present a polynomial-time algorithm for the problem of computing a maximum independent set in outersegment graphs where every segment is either horizontally or vertically aligned. We assume that a geometric representation of the graph is given as input.
|Title of host publication||Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)|
|Number of pages||12|
|Publication status||Published - 2011|