The paper introduces a novel approach to handling intersection graphs of geodesic disks in R2. By utilizing a clique-based separator, the authors extend the class of objects with small separators, enabling efficient algorithms like q-Coloring. The study showcases the development of an almost exact distance oracle for these graphs, addressing challenges in subquadratic storage and query time. Through detailed analysis and innovative techniques, the authors demonstrate significant advancements in computational geometry.
A otro idioma
del contenido fuente
arxiv.org
Ideas clave extraídas de
by Boris Aronov... a las arxiv.org 03-11-2024
https://arxiv.org/pdf/2403.04905.pdfConsultas más profundas