Topological Sort and MST
A recurring theme in asymptotic analysis is that it is often possible to get better asymptotic performance by maintaining extra information about the structure. Updating this extra information may slow down each individual step; this additional cost is sometimes called overhead. However, it is often the case that a small amount of overhead yields dramatic improvements in the asymptotic complexity of the algorithm.
KeywordsSpan Tree Partial Order Greedy Algorithm Minimum Span Tree Total Order
Unable to display preview. Download preview PDF.