An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the number of nodes in the graph. This is an improvement over the previously known quadratic bound. The algorithm can be used to decide emptiness of B

• Type: Conference
• Year: 2000
• Where: FMCAD
• Authors: Roderick Bloem, Harold N. Gabow, Fabio Somenzi
• Keywords: Algorithm, FMCAD 2000, Formal Methods, Quadratic Bound, Strongly Connected Component