Charles Explorer logo
🇨🇿

Near-Optimal Separators in String Graphs

Publikace na Matematicko-fyzikální fakulta |
2014

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

Let G be a string graph (an intersection graph of continuous arcs in the plane) with m edges. Fox and Pach proved that G has a separator consisting of $O(m^{3/4}\sqrt{log m})$ vertices, and they conjectured that the bound of O(root m) actually holds.

We obtain separators with O(root m log m) vertices.