ON THE MINIMUM DIAMETER SPANNING TREE PROBLEM

Authors
HASSIN R TAMIR A
Citation
R. Hassin et A. Tamir, ON THE MINIMUM DIAMETER SPANNING TREE PROBLEM, Information processing letters, 53(2), 1995, pp. 109-111
Citations number
10
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
53
Issue
2
Year of publication
1995
Pages
109 - 111
Database
ISI
SICI code
0020-0190(1995)53:2<109:OTMDST>2.0.ZU;2-#
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 d iameter problem and an extension of its efficiently.