Low stretch spanning trees

David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

The paper provides a brief review of problems and results concerning low stretch and low communication spanning trees for graphs.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings
EditorsKrzysztof Diks, Wojciech Rytter, Wojciech Rytter
PublisherSpringer Verlag
Pages68-80
Number of pages13
ISBN (Print)3540440402, 9783540440406
DOIs
StatePublished - 2002
Externally publishedYes
Event27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, Poland
Duration: 26 Aug 200230 Aug 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2420
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002
Country/TerritoryPoland
CityWarsaw
Period26/08/0230/08/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Fingerprint

Dive into the research topics of 'Low stretch spanning trees'. Together they form a unique fingerprint.

Cite this