LIPIcs.MFCS.2019.65.pdf
- Filesize: 0.54 MB
- 16 pages
Document
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
Authors
-
Part of:
Volume:
44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-08-20
Cite AsGet BibTex
Surender Baswana, Shiv Gupta, and Ayush Tulsyan. Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 65:1-65:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.MFCS.2019.65
https://doi.org/10.4230/LIPIcs.MFCS.2019.65
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Dynamic graph algorithms
Keywords
- Depth first search
- DFS
- Dynamic graph algorithms
- Fault tolerant
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads