DFS tree construction: Algorithms and characterizations

DOI10.1007/3-540-50728-0_37OpenAlexW1527003156MaRDI QIDQ6199456

Ephraim Korach, Zvi Ostfeld

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-50728-0_37

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Depth-first search is inherently sequential
• A new distributed depth-first-search algorithm
• Series - parallel graphs and depth-first search trees
• The even-path problem for graphs and digraphs
• An Efficient Parallel Biconnectivity Algorithm
• An efficient parallel algorithm for shifting the root of a depth first spanning tree
• Efficient Planarity Testing
• Dividing a Graph into Triconnected Components
• Lectures on matroids
• Depth-First Search and Linear Graph Algorithms