Maximum independent set in 2-direction outersegment graphs

Authors:
Holger Flier;Matú/$#353/ Mihal$#225/k;Peter Widmayer;Anna Zych
Affiliations:
Institute of Theoretical Computer Science, ETH Zü/rich, Switzerland;Institute of Theoretical Computer Science, ETH Zü/rich, Switzerland;Institute of Theoretical Computer Science, ETH Zü/rich, Switzerland;Institute of Theoretical Computer Science, ETH Zü/rich, Switzerland
Venue:
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2011

Citing 11
Cited 0

String graphs. I.: the number of critical nonstring graphs is infinite

Journal of Combinatorial Theory Series B
String graphs. II.: Recognizing string graphs is NP-hard

Journal of Combinatorial Theory Series B
String graphs requiring exponential representations

Journal of Combinatorial Theory Series B
The max clique problem in classes of string-graphs

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
The complexity of domination problems in circle graphs

Discrete Applied Mathematics
Graph classes: a survey

Graph classes: a survey
Maximum weight independent sets and cliques in intersection graphs of filaments

Information Processing Letters
On the k-Colouring of Circle-Graphs

STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Recognizing string graphs in NP

Journal of Computer and System Sciences - STOC 2002
Coloring kk-free intersection graphs of geometric objects in the plane

Proceedings of the twenty-fourth annual symposium on Computational geometry
A separator theorem for string graphs and its applications

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.