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: | en_US |
| Published: |
Cambridge University Press
2015
|
| Online Access: | http://hdl.handle.net/1721.1/92846 |