# 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} }

- Published 2015 in CCCG

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

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

## Approximation Algorithms for Independence and Domination on B1-VPG and B1-EPG Graphs

View 5 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 26 references

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

View 6 Excerpts

Highly Influenced

## An optimal algorithm for finding disjoint rectangles and its application to PCB routing

View 3 Excerpts

Highly Influenced

## The max clique problem in classes of string-graphs

View 8 Excerpts

Highly Influenced

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

View 9 Excerpts

Highly Influenced

## The Maximum Disjoint Set of Boundary Rectangles

View 1 Excerpt

## On the Rectangle Escape Problem

View 1 Excerpt

## The Clique Problem in Ray Intersection Graphs

View 2 Excerpts

## String graphs and incomparability graphs

View 1 Excerpt

## Computing the Independence Number of Intersection Graphs

View 1 Excerpt