Minimum Bottleneck Spanning Trees (MBST) Dongfeng

olivia-moreira

Published 2026-08-10 · 45 slides · 0 views

↓ Download

Minimum Bottleneck Spanning Trees (MBST) Dongfeng

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 1 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 2 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 3 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 4 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 5 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 6 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 7 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 8 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 9 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 10 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 11 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 12 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 13 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 14 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 15 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 16 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 17 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 18 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 19 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 20 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 21 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 22 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 23 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 24 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 25 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 26 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 27 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 28 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 29 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 30 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 31 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 32 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 33 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 34 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 35 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 36 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 37 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 38 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 39 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 40 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 41 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 42 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 43 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 44 of 45

Minimum Bottleneck Spanning Trees (MBST) Dongfeng - slide 45 of 45

Description

Minimum Bottleneck Spanning Trees (MBST) Dongfeng Gu Outline Definition Relation between Minimum Bottleneck Spanning Tree (MBST) and Minimum Spanning Tree (MST) Camerinis algorithm for finding an MBST in an undirected connected graph

Download this presentation From Below

"Minimum Bottleneck Spanning Trees (MBST) Dongfeng" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

Minimum Bottleneck Spanning Trees (MBST) Dongfeng Gu

Outline Definition
Relation between Minimum Bottleneck Spanning Tree (MBST) and Minimum Spanning Tree (MST)
Camerini’s algorithm for finding an MBST in an undirected connected graph
Camerini’s algorithm for finding an MBSA in a directed connected graph
Tarjan and Gabow Algorithm for MBSA

Bottleneck Edge Bottleneck edges in a spanning tree are the edges with the maximum weight in the tree 1 2 3 4 5 6 6 8 8

Minimum Bottleneck Spanning Tree (MBST) MBST is a spanning tree which has the minimum bottleneck edge value among all the possible spanning trees in a graph G(V,E). 1 2 3 4 5 6 6 8 8 9 10 11 12 13 14 14

MBST VS MST Minimum Spanning Tree (MST) is necessary a Minimum Bottleneck Spanning Tree (MBST) while the opposite is not.

Therefore any algorithm that can find the MST can also find the MBST. 1 2 3 4 5 6 6 8 8 9 11 12 13 7 10 14

Camerini’s algorithm in undirected graph Given an undirected connected graph G(V,E). Let A be a subset of E such that W(e) >= W(e’) for all e Є A, e’Є B = E\A. Let F be a maximal Forest of GB and η = N1 , N2 , N3 … Nc , where Ni (i = 1,2,…,c) is the set of nodes of the i-th component of F 1 2 3 4 5 6 6 8 8 9 11 12 13 7 Weight of B: 1,2,3,4,5,6,6
Weight of A: 7,8,8,9,10,11,12,13,14 10 14

Camerini’s algorithm in undirected graph Given an undirected connected graph G(V,E). Let A be a subset of E such that W(e) >= W(e’) for all e Є A, e’Є B = E\A. Let F be a maximal Forest of GB and η = N1 , N2 , N3 … Nc , where Ni (i = 1,2,…,c) is the set of nodes of the i-th component of F Weight of B: 1,2,3,4,5,6,6
Weight of A: 7,8,8,9,10,11,12,13,14 F of GB 1 2 3 4 5 6 6 N1 N2 N3

Two theorems Theorem 1: If F is a spanning tree of G, a Minimum Bottleneck Spanning Tree (MBST) of G is given by any MBST of GB .

Theorem 2: If F is not a spanning tree of G, a MBST of G can be obtained by adding to F any MBST of G’, where G’ is the graph GA collapsed in to η, i.e. G’ = (GA)η.

Pseudocode

Example

Time Complexity

Spanning arborescence (MBSA) An arborescence of G(V,E) is a minimal subgraph of G which contains a directed path from a specified node “a” in G to each node of a subset V’ of V-{1}.
Node “a” is called the root of the arborescence. An arborescence is a spanning arborescence if V’ = V - {1}. 1 2 3 4 5 6 6 8 8 9 12 13 14 14 Root(a) 12 12

Camerini’s algorithm for MBSA

Example

Time Complexity UH require O(m)

BUSH requires O(m) at each execution and the number of these executions is O(logm) since |E-T| is being halved at each call of MBSA

Sum up: O(mlogm)

Tarjan and Gabow Algorithm for MBSA Let S be the distinguished root vertex of G, and F be the collection of vertices and their inclusion cost c(v)
Start with F having only node S
Select minimum c(v) in F and delete the S
For every edge(v,w), if w is not in F and not in Tree. Add it along with cost c(w) = weight(v,w) and make v its parent. If w already in F check if weight(v,w) < c(w) then make c(w) = weight(v,w) and make v become the parent of w

Example F

Example F remove->

Example F replace->

Example F

Example F remove->

Example F

Time Complexity This algorithm runs in O(|V|log|V| + |E|) time if Fibonacci heap was used to implement F.

Compare to the Camerini’s algorithmO(|E|log|E|) , if a graph has much more edges than vertexes, then the Tarjan and Gabow algorithm is better.

Reference [1]P.M. Camerini, The Min-Max Spanning Tree Problem And Some Ex- tensions, Information Processing Letters, Vol. 7, Num. 1, January 1978\newline
[2]H.N. Gabow, R.E. Tarjan, Algorithms for Two Bottleneck Optimization Problems, Journal Of Algorithms 9 (1988) 411-417\newline

Thank You! Question?

Minimum Bottleneck Spanning Trees (MBST) Dongfeng

Related Topics

Share

Embed code

Download this presentation From Below

Presentation Transcript