PDF-Breadth rst search on massive graphs Deepak Ajwani Roman Dementiev Ulrich Meyer Vitaly Osipov Abstract We consider the problem of Breadth First Search BFS traversal on massive spa rse undi rected gra
SO
sherrill-nordquist
Published 2015-01-18 | 7094 Views
Despite the existence of simple linear time algorithms in the RAM model it was considered nonviable for massive graphs because of the IO cost it incurs Munag ala
Download Presentation
Download Presentation The PPT/PDF document "Breadth rst search on massive graphs Dee..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.