An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs

@inproceedings{Keil2015AnAF,
  title={An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs},
  author={Mark Keil and Joseph S. B. Mitchell and Dinabandhu Pradhan and Martin Vatshelle},
  booktitle={CCCG},
  year={2015}
}
Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk. Outerstring graphs are among the most general classes of intersection graphs studied. To date, no polynomial time algorithm is known for any of the classical graph optimization problems on outerstring graphs; in fact, most are NP-hard. It is known that there is an intersection model for any outerstring graph that consists of polygonal arcs attached to a… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

String graphs. II. recognizing string graphs is NP-hard

J. Comb. Theory, Ser. B • 1991
View 6 Excerpts
Highly Influenced

The max clique problem in classes of string-graphs

Discrete Mathematics • 1992
View 8 Excerpts
Highly Influenced

Nešetřil. Independent set and clique problems in intersection-defined classes of graphs

J. J. Kratochv́ıl
Comment. Mat. Univ. Carolinae, • 1990
View 9 Excerpts
Highly Influenced

The Clique Problem in Ray Intersection Graphs

Discrete & Computational Geometry • 2013
View 2 Excerpts

String graphs and incomparability graphs

Symposium on Computational Geometry • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…