Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (Q2300733)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster |
scientific article |
Statements
Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (English)
0 references
28 February 2020
0 references
graph algorithms
0 references
space efficiency
0 references
depth-first search
0 references
connectivity
0 references
0 references
0.9113675951957704
0 references
0.9032374024391174
0 references
0.9016062021255492
0 references
0.8762040138244629
0 references
0.8760983943939209
0 references
