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
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
"Breadth rst search on massive graphs Deepak Ajwani Roman Dem…" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.