Introduction to Algorithms
| Hi-index | 0.00 |
Many proofs of properties of algorithms may be simplified by the use of the method of indicator random variables. In addition, the relative speed of competing algorithms for the minimum-spanning-tree prob-lem, and also for the problem of finding shortest paths in a graph, is affected by the development of a data structure called the Fibonacci heap. These are just the most important of the recent advances in the state of the art of analyzing algorithms which, in our opinion, need to be taught as part of the algorithms course. We provide here a large number of updated methods which we have recently used in returning to teaching this course after a hiatus of many years.