233-234
DESCRIPTION
233-234. Sedgewick & Wayne (2004); Chazelle (2005). How to check if adding an edge creates a cycle?. Label i all nodes of i-th tree. 2. 1. 1. 2. 1. 2. 2. How to check if adding an edge creates a cycle?. Label i all nodes of i-th tree. 2. 1. 1. 2. 1. 2. 2. - PowerPoint PPT PresentationTRANSCRIPT
233-234233-234233-234233-234
Sedgewick & Wayne (2004); Chazelle (2005)Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)Sedgewick & Wayne (2004); Chazelle (2005)
How to check if adding an edge creates a cycle?
Label i all nodes of i-th tree
1
1
12
2
2
2
Relabel smaller tree
How to check if adding an edge creates a cycle?
Label i all nodes of i-th tree
2
2
22
2
2
2
Relabel smaller tree
How to check if adding an edge creates a cycle?
Label i all nodes of i-th tree
2
2
22
2
2
2
Each node relabeled at most log V times
Advanced MST Algorithms
Yao/Cheriton-Tarjan
(1976)
Fredman-Tarjan (1984)
Gabow-Galil-Spencer-Tarjan (1986)
Chazelle (2000)