2 search results - page 1 / 1 » Implicit enumeration of strongly connected components |
ICCAD
1999
IEEE
13 years 9 months ago
1999
IEEE
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...