识别双曲几何中的单位圆盘图是$\exists\mathbb{R}$ -完全的
Recognizing Unit Disk Graphs in Hyperbolic Geometry is $\exists\mathbb{R}$-Complete
摘要:
一个图G是(欧几里德)单位圆盘图,如果它是欧几里德平面$\mathbb{R}^2$中单位圆盘的交图.已知识别它们是$\exists\mathbb{R}$完全的,即,就像解一组多项式不等式一样难在本说明中,我们描述了一个简单的框架来翻译$\exists\mathbb{R}$ -硬度减少从欧几里德平面$\mathbb{R}^2$的双曲平面$\mathbb{H}^2$。我们应用我们的框架来证明,在双曲平面的单位盘图的识别也是$\exists\mathbb{R}$ -完全的。
英文摘要:
A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\mathbb{R}^2$. Recognizing them is known to be $\exists\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial inequalities. In this note we describe a simple framework to translate $\exists\mathbb{R}$-hardness reductions from the Euclidean plane $\mathbb{R}^2$ to the hyperbolic plane $\mathbb{H}^2$. We apply our framework to prove that the recognition of unit disk graphs in the hyperbolic plane is also $\exists\mathbb{R}$-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。