Research on the Search Strategy of Complex Network Based on Breadth-First

Article Preview

Abstract:

As the computer science is developing rapidly, the search of technology of graphs has emerged in logic, linguistics, chemistry, electronics and some other fields of science. Especially with the rapid development of network technology as well as the appearance of parallel computer, parallel processing is brought into an unprecedented prosperity. And graphs traversal also starts playing a vital role. Breadth-first-search is a fundamental problem of graph theory as well as a heated problem. The parallelization of breadth-first-search has been a tough problem yet to be solved.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

5348-5351

Citation:

Online since:

May 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Kuang Guijuan, The Application of Breadth-first-search Algorithm in Internet, (2005).

Google Scholar

[2] Yang Aimin, Parallel Breadth-first-search Algorithms, (2012).

Google Scholar

[3] Y. Xia and V.K. Prasanna. Topologically Adaptiveparallel Breadth-first-research on multicore processors. In Proc. 21st Int'l. Conf. on Parallel and Distributed Computing Systems(PD CS'09), Novermber (2009).

Google Scholar

[4] A. Chan, F. Dehne, and R. Taylor. CGMGRAPH/CGMLIB: Implementing and testing CGM graph algorithm on PC clusters and shared memory machines. Int'l. Journal of High Performance Compute. Apl., 2005, 19(1): 81-97.

DOI: 10.1177/1094342005051196

Google Scholar