Sciweavers

CCCG
2006

Geometric Separator for d-Dimensional Ball Graphs

14 years 26 days ago
Geometric Separator for d-Dimensional Ball Graphs
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision. We prove that it can be partitioned into three sets BS, BI, BE such that the intersection of BI and BE is empty, and for some constant , the volume of BI and BE is less than portion of volume of B, and the volume of BS is of size O(/, (
Kebin Wang, Shang-Hua Teng
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where CCCG
Authors Kebin Wang, Shang-Hua Teng
Comments (0)