Chapter 3: Optimal Trees and Branchings - UKP
Chapter 3: Optimal Trees and Branchings - UKP
Chapter 3: Optimal Trees and Branchings - UKP
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Optimal</strong> <strong>Trees</strong> <strong>and</strong> <strong>Branchings</strong><br />
Complexity of MST Algorithms (cont’d)<br />
As m > n − 2 in connected graphs holds, we can estimate n by m.<br />
As m < n 2 , it is log m < log n 2 = 2 log n = O(log n).<br />
Therefore, the total cost is O(m log m), or O(m log n), respectively.<br />
Efficient Graph Algorithms | Wolfgang Stille | WS 2011/2012 | <strong>Chapter</strong> III - <strong>Optimal</strong> <strong>Trees</strong> <strong>and</strong> <strong>Branchings</strong> | 29
Change language