Efficient parallel algorithms for breadth first spanning forests of general graphs

DOI10.1080/00207168608803544zbMath0655.68082OpenAlexW1999408081MaRDI QIDQ3802640

Yixin Zhang

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/00207168608803544

zbMATH Keywords

parallel algorithmbreadth first searchbreadth first spanning trees for graphs

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)

Cites Work

• Unnamed Item

This page was built for publication: Efficient parallel algorithms for breadth first spanning forests of general graphs