Incremental DFS algorithms: a theoretical and experimental study

zbMATH Open1403.68147arXiv1705.02613MaRDI QIDQ4607876FDOQ4607876

Authors: Surender Baswana, Ayush Goel, Shahbaz Khan 

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1705.02613

Recommendations

• An improved algorithm for incremental DFS tree in undirected graphs
• The incremental maintenance of a depth-first-search tree in directed acyclic graphs
• Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
• On Dynamic DFS Tree in Directed Graphs
• Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05)

Cited In (7)

• Title not available (Why is that?)
• The incremental maintenance of a depth-first-search tree in directed acyclic graphs
• An improved algorithm for incremental DFS tree in undirected graphs
• Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
• Fault tolerant depth first search in undirected graphs: simple yet efficient
• Space-efficient fully dynamic DFS in undirected graphs
• Fully dynamic connectivity oracles under general vertex updates

This page was built for publication: Incremental DFS algorithms: a theoretical and experimental study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607876)