On the minimum diameter spanning tree problem

Research output: Contribution to journalArticlepeer-review

Abstract

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
Volume53
Issue number2
DOIs
StatePublished - 27 Jan 1995

Keywords

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

Fingerprint

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

Cite this