Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs

DOI10.1007/978-3-662-43948-7_12zbMath1370.68227OpenAlexW31329063MaRDI QIDQ5167737

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

dynamicundirected graphdepth first searchincremental

Mathematics Subject Classification ID

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

Related Items (7)

Incremental algorithm for maintaining a DFS tree for undirected graphs ⋮ On Dynamic DFS Tree in Directed Graphs ⋮ A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Space-efficient fully dynamic DFS 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