A note on parallel depth first search

DOI10.1007/BF01933745MaRDI QIDQ1075058zbMATH OpenFDO

Authors Yixin Zhang

Publication date 1986

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

directed acyclic graphparallel algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parallel algorithms for a depth first search and a breadth first search
• Parallel Algorithms for Depth-First Searches I. Planar Graphs
• A parallel algorithm for recognizing unordered depth-first search
• Parallel depth first search. I: Implementation
• scientific article; zbMATH DE number 4068310

Cites work

• A parallel search algorithm for directed acyclic graphs

Cited in

(6)

• Scalable Parallel DFPN Search
• scientific article; zbMATH DE number 3990867 (Why is no real title available?)
• Parallel algorithms for a depth first search and a breadth first search
• scientific article; zbMATH DE number 865205 (Why is no real title available?)
• Planar Depth-First Search in $O(\log n)$ Parallel Time
• Parallel depth first search. I: Implementation

This page was built for publication: A note on parallel depth first search

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