Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs

DOI10.1007/978-3-662-43948-7_12MaRDI QIDQ5167737zbMATH OpenOpenAlexFDO

Authors Surender Baswana, Shahbaz Khan

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43948-7_12

zbMATH Keywords

depth first searchdynamicincrementalundirected graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Incremental algorithm for maintaining a DFS tree for undirected graphs
• An improved algorithm for incremental DFS tree in undirected graphs
• The incremental maintenance of a depth-first-search tree in directed acyclic graphs
• Incremental DFS algorithms: a theoretical and experimental study
• On Dynamic DFS Tree in Directed Graphs
• A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
• Incremental minimum spanning tree algorithms
• Space-efficient fully dynamic DFS in undirected graphs
• Dynamic algorithms for graphs of bounded treewidth
• Dynamic algorithms for graphs of bounded treewidth

Cited in

(10)

• Space-efficient fully dynamic DFS in undirected graphs
• Incremental algorithm for maintaining a DFS tree for undirected graphs
• The incremental maintenance of a depth-first-search tree in directed acyclic graphs
• On Dynamic DFS Tree in Directed Graphs
• A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
• Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
• Incremental DFS algorithms: a theoretical and experimental study
• Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
• An improved algorithm for incremental DFS tree in undirected graphs
• Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier

This page was built for publication: Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs

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