scientific article; zbMATH DE number 7561709
From MaRDI portal
Publication:5092428
DOI10.4230/LIPIcs.MFCS.2019.65MaRDI QIDQ5092428
Shiv K. Gupta, Ayush Tulsyan, Surender Baswana
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.01726
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Fault tolerant depth first search in undirected graphs: simple yet efficient ⋮ Mincut sensitivity data structures for the insertion of an edge ⋮ Space-efficient fully dynamic DFS in undirected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs
- \(f\)-sensitivity distance oracles and routing schemes
- Fully-dynamic min-cut
- Depth-first search is inherently sequential
- Fractional cascading. I: A data structuring technique
- A topological approach to dynamic graph connectivity
- Complexity models for incremental computation
- Dynamically switching vertices in planar graphs
- Fault-tolerant approximate shortest-path trees
- A data structure for dynamic trees
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
- On Dynamic DFS Tree in Directed Graphs
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
- Dynamic Connectivity: Connecting to Networks and Geometry
- Parallel Depth-First Search in General Directed Graphs
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Fully dynamic randomized algorithms for graph spanners
- Oracles for Distances Avoiding a Failed Node or Link
- Improved Dynamic Reachability Algorithms for Directed Graphs
- New Data Structures for Subgraph Connectivity
- An On-Line Edge-Deletion Problem
- Sparsification—a technique for speeding up dynamic graph algorithms
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
- Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
- Multiple-edge-fault-tolerant approximate shortest-path trees
- Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version)
- Multiple Source Dual Fault Tolerant BFS Trees
- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
- Fault Tolerant Spanners for General Graphs
- A new approach to dynamic all pairs shortest paths
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Depth-First Search and Linear Graph Algorithms
- Dynamic graph connectivity in polylogarithmic worst case time
- Fully dynamic geometric spanners
This page was built for publication:
