Arrow Research search
Back to MFCS

MFCS 2002

Low Stretch Spanning Trees

Invited Paper Invited Talks Algorithms and Complexity ยท Theoretical Computer Science

Abstract

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

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
823128972851747020
v2026.09.13