Low stretch spanning trees

David Peleg

doi:10.1007/3-540-45687-2_5

Low stretch spanning trees

David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

16 Scopus citations

Abstract

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

Original language	English
Title of host publication	Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings
Editors	Krzysztof Diks, Wojciech Rytter, Wojciech Rytter
Publisher	Springer Verlag
Pages	68-80
Number of pages	13
ISBN (Print)	3540440402, 9783540440406
DOIs	https://doi.org/10.1007/3-540-45687-2_5
State	Published - 2002
Externally published	Yes
Event	27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, Poland Duration: 26 Aug 2002 → 30 Aug 2002

Publication series

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

Conference

Conference	27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002
Country/Territory	Poland
City	Warsaw
Period	26/08/02 → 30/08/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Access to Document

10.1007/3-540-45687-2_5

Cite this

Peleg, D. (2002). Low stretch spanning trees. In K. Diks, W. Rytter, & W. Rytter (Eds.), Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings (pp. 68-80). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2420). Springer Verlag. https://doi.org/10.1007/3-540-45687-2_5

Peleg, David. / Low stretch spanning trees. Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. editor / Krzysztof Diks ; Wojciech Rytter ; Wojciech Rytter. Springer Verlag, 2002. pp. 68-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3f19f9571c8f462e8df83118cf2dc190,

title = "Low stretch spanning trees",

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

author = "David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 ; Conference date: 26-08-2002 Through 30-08-2002",

year = "2002",

doi = "10.1007/3-540-45687-2\_5",

language = "אנגלית",

isbn = "3540440402",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "68--80",

editor = "Krzysztof Diks and Wojciech Rytter and Wojciech Rytter",

booktitle = "Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings",

address = "גרמניה",

}

Peleg, D 2002, Low stretch spanning trees. in K Diks, W Rytter & W Rytter (eds), Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2420, Springer Verlag, pp. 68-80, 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, Warsaw, Poland, 26/08/02. https://doi.org/10.1007/3-540-45687-2_5

Low stretch spanning trees. / Peleg, David.
Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. ed. / Krzysztof Diks; Wojciech Rytter; Wojciech Rytter. Springer Verlag, 2002. p. 68-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2420).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Low stretch spanning trees

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

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

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

UR - https://www.scopus.com/pages/publications/84957004427

U2 - 10.1007/3-540-45687-2_5

DO - 10.1007/3-540-45687-2_5

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957004427

SN - 3540440402

SN - 9783540440406

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 68

EP - 80

BT - Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings

A2 - Diks, Krzysztof

A2 - Rytter, Wojciech

PB - Springer Verlag

T2 - 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002

Y2 - 26 August 2002 through 30 August 2002

ER -

Peleg D. Low stretch spanning trees. In Diks K, Rytter W, Rytter W, editors, Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. Springer Verlag. 2002. p. 68-80. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45687-2_5

Low stretch spanning trees

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this