A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (Q2980917)
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 6711895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs |
scientific article; zbMATH DE number 6711895 |
Statements
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (English)
0 references
5 May 2017
0 references
0 references
0.9655542
0 references
0.9181707
0 references
0.9181707
0 references
0.9024907
0 references
0.89754975
0 references
0.8872249
0 references
0.88636756
0 references
0.8849797
0 references
0.8849797
0 references
0.88398474
0 references
