Fault tolerant depth first search in undirected graphs: simple yet efficient
From MaRDI portal
Publication:2149103
DOI10.1007/S00453-022-00947-7zbMATH Open1502.68206OpenAlexW4214576505MaRDI QIDQ2149103FDOQ2149103
Authors: Surender Baswana, Ayush Tulsyan, S. K. Gupta 
Publication date: 28 June 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00947-7
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- A data structure for dynamic trees
- Oracles for Distances Avoiding a Failed Node or Link
- A nearly optimal oracle for avoiding failed vertices and edges
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs
- Parallel Depth-First Search in General Directed Graphs
- Fault tolerant spanners for general graphs
- Title not available (Why is that?)
- Fractional cascading. I: A data structuring technique
- Parallel Algorithms for Depth-First Searches I. Planar Graphs
- Dynamic subgraph connectivity with geometric applications
- Dynamically switching vertices in planar graphs
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Space-efficient fully dynamic DFS in undirected graphs
- Faster randomized worst-case update time for dynamic subgraph connectivity
- Incremental algorithm for maintaining a DFS tree for undirected graphs
- On Dynamic DFS Tree in Directed Graphs
- Incremental DFS algorithms: a theoretical and experimental study
- Title not available (Why is that?)
- An improved algorithm for incremental DFS tree in undirected graphs
This page was built for publication: Fault tolerant depth first search in undirected graphs: simple yet efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149103)
