Parallel Graph Algorithms课件.ppt

CS267/EngC233 Spring 2010 April 15, 2010;Applications Review of key results Case studies: Graph traversal-based problems, parallel algorithms Breadth-First Search Single-source Shortest paths Betweenness Centrality Community Identification;Road networks, Point-to-point shortest paths: 15 seconds (na?ve) ? 10 microseconds;The world-wide web can be represented as a directed graph Web search and crawl: traversal Link analysis, ranking: Page rank and HITS Document classification and clustering Internet topologies (router networks) are naturally modeled as graphs ;Reorderings for sparse solvers Fi