Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328)
From MaRDI portal
scientific article; zbMATH DE number 7100382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier |
scientific article; zbMATH DE number 7100382 |
Statements
Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (English)
0 references
2 September 2019
0 references
depth first search
0 references
DFS
0 references
dynamic graph algorithm
0 references
0 references
0 references
0 references
