Abstract
An algorithm for finding the biconnected components of an undirected graph and an improved version of an algorithm for finding the strongly connected components of a directed graph are presented.
| Original language | English (US) |
|---|---|
| Pages | 114-121 |
| Number of pages | 8 |
| State | Published - 1971 |
| Event | IEEE Conf Rec 1971 12th annu symp on switching & automata theory - East Lansing, Mich Duration: Oct 13 1971 → Oct 15 1971 |
Other
| Other | IEEE Conf Rec 1971 12th annu symp on switching & automata theory |
|---|---|
| City | East Lansing, Mich |
| Period | 10/13/71 → 10/15/71 |
All Science Journal Classification (ASJC) codes
- General Engineering