ppt课件-c s267 graph partitioning（c s267图分区）.pptVIP

* CS267, Yelick * Pattern is ?, 2/3, ?, etc Want an algorithms that does as well if the graph is “mesh-like” * CS267, Yelick * When is a graph mesh-like? Here’s a technical definition So a 1-ply neighborhood is a set of non-intersecting disks a 2-ply neighborhood has disk intersections of no more than 2 disks each An (alpha, 1) overlap graph has a set of non-overlapping disks if we grow a disks by more than alpha * CS267, Yelick * In 2d take out sqrt, in 3D take out 2/3 root, 4D ? root, etc. Nice theorem says that if I pick random spheres (in the right sense) you’ll get a good one w