A Naïve Breadth First Search Approach Incorporating Parallel Processing Technique For Optimal Network Traversal
Laxmikant Revdikar, Ayush Mittal, Anuj Sharma, Dr. Sunanda Gupta
Abstract: The authors have modied the existing breadth first search (BFS) technique by incorporating a parallel processing feature to it. A multithreaded implementation of breadth-first search (BFS) of a graph using Open MP. the results of our research reveal that implementing BFS using multiprocessor runs much faster than the standard BFS.
Keywords: Breadth-First Search, Parallel Programming, optimal Network Traversal Open MP.
This work is licensed under a Creative Commons Attribution 4.0 International License.How to Cite:
[1] Laxmikant Revdikar, Ayush Mittal, Anuj Sharma, Dr. Sunanda Gupta, “A Naïve Breadth First Search Approach Incorporating Parallel Processing Technique For Optimal Network Traversal,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2016.55219