Same as bridges: for DFS traversal. You visit each vertex once and each edge twice (once from each direction). Checking conditions and updating low-link values is per edge. Space complexity: for recursion stack, discovery times, low-link values, and the result set.
Total: . This is best for finding articulation points because you need to examine every edge to determine reachability and connectivity.