The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
| Hi-index | 0.00 |
It is shown that the problem of finding the biconnected components of an undirected graph is, in a certain sense, a special case of the problem of finding the strongly connected components of a directed graph. Therefore, the linear-time algorithm for the former can be derived from the linear-time algorithm for the latter.