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

伸展伸展

Stretching Stretch

Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu

摘要:

我们给出了一个广义的拉伸定义,简化了低拉伸嵌入适合图算法的有效建设。的推广,折扣高度拉伸的边缘,通过采取他们的$p$ -th权力的一些$0 < p < 1$,直接关系到现有算法的性能。这种高拉伸边缘的折扣允许我们以更粗的粒度处理许多类别的边缘。它导致了一个两遍的方法,结合自底向上的聚类和自顶向下的分解,以构建这些嵌入在$\mathcal{O}(m\log\log{n})$的时间。我们的算法并行化容易,也可以产生低拉伸子图的推广。

英文摘要:

We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discounting highly stretched edges by taking their $p$-th power for some $0 < p < 1$, is directly related to performances of existing algorithms. This discounting of high-stretch edges allows us to treat many classes of edges with coarser granularity. It leads to a two-pass approach that combines bottom-up clustering and top-down decompositions to construct these embeddings in $\mathcal{O}(m\log\log{n})$ time. Our algorithm parallelizes readily and can also produce generalizations of low-stretch subgraphs.

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

↑