Applications of a New Separator Theorem for String Graphs
An intersection graph of curves in the plane is called a string graph. Matousek almost completely settled a conjecture of the authors by showing that every string graph with m edges admits a vertex separator of size O(√m log m). In the present note, this bound is combined with a result of the author...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press,
2015-01-14T13:50:00Z.
|
| Subjects: | |
| Online Access: | Get fulltext |