Recognition of DFS trees: Sequential and parallel algorithms with refined verifications

DOI10.1016/0012-365X(93)90375-4MaRDI QIDQ685690zbMATH OpenFDO

Authors Ephraim Korach, Zvi Ostfeld

Publication date 24 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmdepth-first searchgraph algorithmsacyclic graphCREW PRAMDFS treerefined verification

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distributed algorithms (68W15)

Recommendations

• On the recognition of search trees generated by BFS and DFS
• A parallel algorithm for recognizing unordered depth-first search
• Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees
• Series - parallel graphs and depth-first search trees
• The recognition problem of graph search trees
• Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
• A unified approach to parallel depth-first traversals of general trees
• Automated verification of parallel nested DFS
• Recognizing breadth-first search trees in linear time

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
• A new distributed depth-first-search algorithm
• A parallel algorithm for recognizing unordered depth-first search
• A random NC algorithm for depth first search
• An Efficient Parallel Biconnectivity Algorithm
• An efficient parallel algorithm for shifting the root of a depth first spanning tree
• Depth-First Search and Linear Graph Algorithms
• Depth-first search is inherently sequential
• Dividing a Graph into Triconnected Components
• Efficient Planarity Testing
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On efficient parallel strong orientation
• On finding optimal and near-optimal lineal spanning trees
• Parallel Algorithms for Depth-First Searches I. Planar Graphs
• Parallel Prefix Computation
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
• Series - parallel graphs and depth-first search trees

Cited in

(8)

• A parallel algorithm for recognizing unordered depth-first search
• DFS tree construction: Algorithms and characterizations
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
• Depth-first search is inherently sequential
• Series - parallel graphs and depth-first search trees
• The recognition problem of graph search trees
• A new distributed depth-first-search algorithm
• On the recognition of search trees generated by BFS and DFS

Describes a project that uses

Uses Software

• Algorithm 447

This page was built for publication: Recognition of DFS trees: Sequential and parallel algorithms with refined verifications

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