DYNAMIC DFS IN UNDIRECTED GRAPHS: BREAKING THE \bfitO (\bfitm ) BARRIER\ast (original) (raw)
Related papers
Dynamic DFS Tree in Undirected Graphs: breaking the $ O (m) $ barrier
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
Lecture Notes in Computer Science, 2014
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Engineering DFS-based graph algorithms
Fault Tolerant Reachability for Directed Graphs
Lecture Notes in Computer Science, 2015
Sparse Fault-Tolerant BFS Trees
2013
Indexing Graph Search Trees and Applications
ArXiv, 2019
A data structure for dynamic trees
Journal of Computer and System Sciences, 1983
Fault tolerance and storage reduction in binary search trees
Information and Control, 1984
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02, 2002
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms, 2000
arXiv (Cornell University), 2022
Efficient Bulk Operations on Dynamic R-Trees
Algorithmica, 2002
Duplicate Avoidance in Depth-First Search with Applications to Treewidth
Faster Parallel Core Maintenance Algorithms in Dynamic Graphs
IEEE Transactions on Parallel and Distributed Systems, 2019
Dynamic graph connectivity in polylogarithmic worst case time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
Mathematical Programming, 1997
A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
International Journal of Foundations of Computer Science, 1996
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
2016
Fully Dynamic Balanced and Distributed Search Trees with Logarithmic Costs
1999
ACM Journal of Experimental Algorithmics, 2009
Lecture Notes in Computer Science, 1999
Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree
Lecture Notes in Computer Science, 2014
Red–black trees with constant update time
Acta Informatica
Dynamic data structures for series parallel digraphs
Algorithms and Data Structures, 1989
DBL: Efficient Reachability Queries on Dynamic Graphs
Database Systems for Advanced Applications, 2021
On the Feasibility of Maintenance Algorithms in Dynamic Graphs
2011
Best-First Search for Bounded-Depth Trees
Fourth Annual Symposium on Combinatorial Search, 2011
A uniform approach to semi-dynamic problems on digraphs
Serafino Cicerone, Umberto Nanni
Theoretical Computer Science, 1998
DEPTH-FIRST SEARCH AND LINEAR GRAPH ALGORITHMS
Recognizing Graph Search Trees
Electronic Notes in Theoretical Computer Science, 2019
Fully dynamic distributed search trees can be balanced in O (lg2 N) time
2002
On-Line Maintenance of Triconnected Components with SPQR-Trees
Algorithmica, 1996