Efficient algorithms for extracting the K most critical paths in timing analysis
S. H. Yen, D. H. Du, S. Ghanta · 1989
Path extracting algorithms are a very important part of timing analysis approach. In this paper we designed and developed several algorithms which can generate the K most critical paths in a non-increasing order of their delays. The effectiveness of these algorithms is shown by some experimental results.