Computing Maximum Independent Set on Outerstring Graphs and Their Relatives

Prosenjit Bose, Paz Carmi, J. Mark Keil +4

A graph $G$ with $n$ vertices is called an outerstring graph if it has an intersection representation of a set of $n$ curves inside a disk such that one endpoint of every curve is…