Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
Data Structures and Algorithms
2019-03-28 v2 Discrete Mathematics
Abstract
We present an algorithm for a fault tolerant Depth First Search (DFS) Tree in an undirected graph. This algorithm is drastically simpler than the current state-of-the-art algorithms for this problem, uses optimal space and optimal preprocessing time, and still achieves better time complexity. This algorithm also leads to a better time complexity for maintaining a DFS tree in a fully dynamic environment.
Cite
@article{arxiv.1810.01726,
title = {Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient},
author = {Surender Baswana and Shiv Kumar Gupta and Ayush Tulsyan},
journal= {arXiv preprint arXiv:1810.01726},
year = {2019}
}
Comments
16 pages, 2 figures