Lower-Stretch Spanning Trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).

Keywords

Data Structures and Algorithms, Discrete Mathematics, F.2.2; G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32446

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0411064
 http://arxiv.org/abs/cs/0411064

Collections

arXiv