<s>
In	O
mathematics	O
,	O
a	O
minimum	B-Algorithm
bottleneck	I-Algorithm
spanning	I-Algorithm
tree	I-Algorithm
(	O
MBST	O
)	O
in	O
an	O
undirected	O
graph	O
is	O
a	O
spanning	O
tree	O
in	O
which	O
the	O
most	O
expensive	O
edge	O
is	O
as	O
cheap	O
as	O
possible	O
.	O
</s>
<s>
A	O
spanning	O
tree	O
is	O
a	O
minimum	B-Algorithm
bottleneck	I-Algorithm
spanning	I-Algorithm
tree	I-Algorithm
if	O
the	O
graph	O
does	O
not	O
contain	O
a	O
spanning	O
tree	O
with	O
a	O
smaller	O
bottleneck	O
edge	O
weight	O
.	O
</s>
<s>
We	O
define	O
subset	O
of	O
minimum	B-Algorithm
bottleneck	I-Algorithm
spanning	I-Algorithm
trees	I-Algorithm
S	O
such	O
that	O
for	O
every	O
and	O
we	O
have	O
for	O
all	O
i	O
andk	O
.	O
</s>
<s>
Camerini	O
proposed	O
an	O
algorithm	O
used	O
to	O
obtain	O
a	O
minimum	B-Algorithm
bottleneck	I-Algorithm
spanning	I-Algorithm
tree	I-Algorithm
(	O
MBST	O
)	O
in	O
a	O
given	O
undirected	O
,	O
connected	O
,	O
edge-weighted	O
graph	O
in	O
1978	O
.	O
</s>
<s>
Gabow	O
and	O
Tarjan	O
provided	O
a	O
modification	O
of	O
Dijkstra	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
for	O
single-source	O
shortest	O
path	O
that	O
produces	O
an	O
MBSA	O
.	O
</s>
<s>
Their	O
algorithm	O
runs	O
in	O
O( E+VlogV	O
)	O
time	O
if	O
Fibonacci	B-Application
heap	I-Application
used	O
.	O
</s>
