arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.21585cs.CG
收藏

计算线段交图的圈长

Computing the Girth of a Segment Intersection Graph

Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校西贝尔计算与数据科学学院)

Timothy M. Chan, Yuancheng Yu

AI总结:

本文提出一种算法,能在O(n^1.483)时间内计算平面中n条线段的交图的圈长,首次达到O(n^{3/2-ε})的时间复杂度,推动了Chan在SODA 2023中提出的问题。

摘要:

我们提出一种算法,能够在O(n^{1.483})的期望时间内计算平面中给定n条线段的交图的圈长。这是首个达到O(n^{3/2-ε})时间复杂度的算法,其中ε是正常数,且推动了Chan在SODA 2023中提出的问题。主要技术包括(i)最近的子立方算法用于有界差最小加法矩阵乘法,以及(ii)平面图分割定理的一种有趣变体。该结果扩展到连接的代数曲线或描述复杂度为常数的半代数集的交图。

英文摘要:

We present an algorithm that computes the girth of the intersection graph of $n$ given line segments in the plane in $O(n^{1.483})$ expected time. This is the first such algorithm with $O(n^{3/2-\varepsilon})$ running time for a positive constant $\varepsilon$, and makes progress towards an open question posed by Chan (SODA 2023). The main techniques include (i)~the usage of recent subcubic algorithms for bounded-difference min-plus matrix multiplication, and (ii)~an interesting variant of the planar graph separator theorem. The result extends to intersection graphs of connected algebraic curves or semialgebraic sets of constant description complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑