efficient algorithms for extracting the k most critical paths in timing analysis
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.
efficiency algorithm critic time analysis paper order delay effect experimentation