A space-efficient algorithm for finding strongly connected components (Q888958)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6504974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A space-efficient algorithm for finding strongly connected components |
scientific article; zbMATH DE number 6504974 |
Statements
A space-efficient algorithm for finding strongly connected components (English)
0 references
5 November 2015
0 references
graph algorithms
0 references
strongly connected components
0 references
depth-first search
0 references
0.7830479741096497
0 references
0.7258228063583374
0 references
0.7209203243255615
0 references
