Pages that link to "Item:Q2312405"
From MaRDI portal
The following pages link to Space-efficient fully dynamic DFS in undirected graphs (Q2312405):
Displaying 7 items.
- Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (Q2980917) (← links)
- (Q4553236) (← links)
- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs (Q5167737) (← links)
- A Snap-Stabilizing DFS with a Lower Space Requirement (Q5307031) (← links)
- Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries (Q6173217) (← links)