Skip to main content
Conference Proceedings

Spanning trees with low maximum/average stretch

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2653 6
DOI: 10.1007/3-540-44849-7_6
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The talk will provide an overview of problems and results concerning spanning trees with low maximum or average stretch and trees with low communication cost, in weighted or unweighted graphs and in metrics, and outline some techniques for dealing with these problems.

Cite

CITATION STYLE

APA

Peleg, D. (2003). Spanning trees with low maximum/average stretch. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2653, p. 6). Springer Verlag. https://doi.org/10.1007/3-540-44849-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free