TY - JOUR
T1 - On the minimum diameter spanning tree problem
AU - Hassin, Refael
AU - Tamir, Arie
PY - 1995/1/27
Y1 - 1995/1/27
N2 - 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.
AB - 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.
KW - Absolute 1-center
KW - Algorithms
KW - Combinatorial problems
KW - Minimum diameter spanning tree
UR - http://www.scopus.com/inward/record.url?scp=0029219324&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(94)00183-Y
DO - 10.1016/0020-0190(94)00183-Y
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0029219324
SN - 0020-0190
VL - 53
SP - 109
EP - 111
JO - Information Processing Letters
JF - Information Processing Letters
IS - 2
ER -