Parallel algorithms for a depth first search and a breadth first search

DOI10.1080/00207168608803503zbMath0655.68081OpenAlexW2049713017MaRDI QIDQ3802639

Taenam Kim, Kyung-Yong Chwa

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803503

zbMATH Keywords

parallel algorithmtime complexitybreadth first searchshortest path algorithmdepth first searchserial algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Fast parallel graph searching with applications ⋮ Parallel search algorithms for graphs and trees

Cites Work

• Unnamed Item
• Parallel breadth-first search algorithms for trees and graphs
• Parallel Matrix and Graph Algorithms
• Fast parallel sorting algorithms

This page was built for publication: Parallel algorithms for a depth first search and a breadth first search