Path-based depth-first search for strong and biconnected components (2000)
Cached
Download Links
- [www.cs.colorado.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu:80]
- [www.cs.princeton.edu]
- DBLP
Other Repositories/Bibliography
by
Harold N. Gabow
| Venue: | Information Processing Letters |
| Citations: | 21 - 0 self |
BibTeX
@ARTICLE{Gabow00path-baseddepth-first,
author = {Harold N. Gabow},
title = {Path-based depth-first search for strong and biconnected components},
journal = {Information Processing Letters},
year = {2000},
volume = {74},
pages = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Key words: Graph, depth-first search, strongly connected component, biconnected component, stack.
