arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0605013cs.DMcs.DS
收藏

低维图的几何表示

Geometric representation of graphs in low dimension

L. Sunil Chandran, Mathew C Francis, Naveen Sivadasan

摘要:

给出了任意n阶图G在$1.5 (Δ+ 2) \ln n$维上的盒表示的一个有效的随机算法,其中$Δ$是G的最大度.我们还证明了对任意图G.我们的界紧到因子$\ln n$。我们还表明,我们的随机算法可以去随机化,得到一个多项式时间确定性算法。虽然我们的一般上限是在最大程度$Δ$,我们表明,几乎所有的图在n个顶点,它的盒度是上限由$c\cdot(d_{av} + 1) \ln n$,其中d_{av}是平均度和c是一个小常数。同时,我们证明了对任意图G,对于常数b,紧到因子$b \sqrt{\ln n}$的$\boxi(G) \le \sqrt{8 n d_{av} \ln n}$.

英文摘要:

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (Δ+ 2) \ln n$ dimensions, where $Δ$ is the maximum degree of G. We also show that $\boxi(G) \le (Δ+ 2) \ln n$ for any graph G. Our bound is tight up to a factor of $\ln n$. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree $Δ$, we show that for almost all graphs on n vertices, its boxicity is upper bound by $c\cdot(d_{av} + 1) \ln n$ where d_{av} is the average degree and c is a small constant. Also, we show that for any graph G, $\boxi(G) \le \sqrt{8 n d_{av} \ln n}$, which is tight up to a factor of $b \sqrt{\ln n}$ for a constant b.

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

↑