We present an algorithm that computes in a linear number of symbolic steps (O(|V|)) the strongly connected components (sccs) of a graph G = 〈V, E〉 represented by an Ordered Binary Decision Diagram (OBDD). This result matches the complexity of the (celebrated) Tarjan's algorithm operating on explicit data structures. To date, the best algorithm for the above problem works in Θ(|V|log|V|) symbolic steps ([BGS00]).
展开▼
机译：我们提出了一种算法，该算法以线性数量的符号步长（ O （＆verbar; V ＆verbar;））计算图的强连通分量（sccs）由有序二元决策图（OBDD）表示的G = 〈< I> V，E >。此结果与在显式数据结构上运行的（经过优化的）Tarjan算法的复杂度相匹配。迄今为止，解决上述问题的最佳算法适用于Θ（＆verbar; V ＆verbar; log＆verbar; V ＆verbar;）符号步骤（[BGS00]）。
展开▼
