A parallel algorithm for recognizing unordered depth-first search

DOI10.1016/0020-0190(88)90172-XzbMath0658.68083OpenAlexW2093602721MaRDI QIDQ1111396

Jeffrey Scott Vitter, Catherine A. Schevon

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90172-x

zbMATH Keywords

parallel algorithmdepth-first searchconcurrent-read, exclusive-write PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

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

Cites Work

• A parallel search algorithm for directed acyclic graphs
• A random NC algorithm for depth first search
• Finding the maximum, merging, and sorting in a parallel computation model

This page was built for publication: A parallel algorithm for recognizing unordered depth-first search