Computing breadth first search in large graph using hMetis partitioning

European Journal of Scientific Research

Volumn 29, Issue 2, 2009, Pages 215-221

  Idwan, Sahar ^a   Etaiwi, Wael ^b  

^a HASHEMITE UNIVERSITY   (Jordan)

^b AL BALQA APPLIED UNIVERSITY   (Jordan)

Author keywords

BFS; Graph; hMetis; h_BFS

Indexed keywords

EID: 65249151280     PISSN: 1450216X     EISSN: 1450202X     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. A. Yoo, E. Chow, K. Henderson, W. Mcledon, B. Hendrickson, and Ü. Çatalyürek, 2005, 2005. A scalable distributed parallel breadth-first search algorithm on Bluegene/L. In Proc Supercomputing (SC 2005), Seattle, WA.
2. David A. Bader; Kamesh Madduri, 2006. Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2, Parallel Processing ICPP 2006. International Conference on Parallel Processing, Page(s):523 - 530 Deepak Ajwani, R. Dementiev, U. Meyer, and V. Osipov, 2006. Breadth First search on massive. Graphs. The Ninth DIMACS Implementation Challenge:
3. The Shortest Path Problem. November 13 - 14, DIMACS Center, Rutgers University, Piscataway, NJ
4. Deepak Ajwani, Ulrich Meyer, Vitaly Osipov, 2007. Improved external memory BFS implementations In Workshop on Algorithm engineering and experiments (ALENEX 07), pages 3-12. New Orleans, USA.
5. Deepak Ajwani, 2005. Design, implementation and experimental study of external memory BFS algorithms, M.Sc. Thesis, Universität des Saarlandes
6. rd Edition, Thomson.
7. G. Karypis and V. Kumar, 1999. "Multi Level k-way hypergraph partitioning," in design Automation Conference, pp. 343-348.
8. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, 1997. "Multi Level hypergraph partitioning: Application in vlsi domain,"in DAC 97: Proceedings of the 34th annual conference on Design Automation, (New York, NY, USA), pp. 526-529, ACM Press.
9. G. Karypis and V. Kumar, 1998. hMETIS Ahypergraph Partitioning Package version 1.5.3 University of Minnesota.
10. G. Karypis and V. Kumar, N. Jing, and E. A., 1996. Rundensteiner, "Effective graph clustering for path queries in digital map databases," in CIKM 1996: Proceedings of the fifth international conference on Information and knowledge management, (New York, NY, USA), pp. 215-222, ACM Press.
11. Harvey Deitel and Paul Deitel, 2005. C++ How to Program, 5th edition, Prentice Hall,2005
12. th Annual ACM-SIAM Symp. On Discrete Algorithms, pages 87-88, Philadelphia, PA, USA.
13. st National Conference on Artificial Intelligence (AAAI-06), Boston, MA.
14. th International conference on Automated Planning and Scheduling (ICAPS-04),92-100
15. Zhou, R., and Hansen, E. 2006. Breath-First heuristic search. Artificial Intelligence 170:385-408