Space-Efficient Fully Dynamic DFS in Undirected Graphs <sup>†</sup>
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in <inline-formula> <math display="inline"> <semantics> <mrow> <mi>O</mi> <mo>(</mo> <mi>n</mi> <mo>+</mo> <mi>m</mi>...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-02-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/12/3/52 |