On the minimum diameter spanning tree problem

Refael Hassin*, Arie Tamir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We point out a relation between the minimum diameter spanning tree of a graph and its absolute 1-center. We use this relation to solve the diameter problem and an extension of it efficiently.

Original languageEnglish
Pages (from-to)109-111
Number of pages3
JournalInformation Processing Letters
Issue number2
StatePublished - 27 Jan 1995


  • Absolute 1-center
  • Algorithms
  • Combinatorial problems
  • Minimum diameter spanning tree


Dive into the research topics of 'On the minimum diameter spanning tree problem'. Together they form a unique fingerprint.

Cite this