Partitioning planar graphs with costs and weights

作     者：Aleksandrov, Lyudmil Djidjev, Hristo Guo, Hua Maheshwari, Anil 

作者机构：Bulgarian Academy of Sciences IPOI Acad. G. Bonchev Str. Bl. 25-A Sofia 1113 Bulgaria Los Alamos National Laboratory Basic and Applied Simulation Science (CCS-5) MS M997 Los Alamos 87545 NM United States School of Computer Science Carleton University 1125 Colonel By Drive Ottawa K1S 5B6 ON Canada 

出 版 物：《ACM Journal of Experimental Algorithmics》 

年 卷 期：2006年第11卷

页      面：1.5–es页

基　　金：Engineering and Physical Sciences Research Council Natural Sciences and Engineering Research Council of Canada, (GR/M60750) 

主　　题：Algorithms Design G2.2 [Graph Theory]: Graph algorithms - Mathematics of computation Graph algorithms Graph partitioning algorithms Graph separators Implementation Performance 

摘      要：A graph separator is a set of vertices or edges whose removal divides an input graph into components of bounded size. This paper describes new algorithms for computing separators in planar graphs as well as techniques that can be used to speed up the implementation of graph partitioning algorithms and improve the partition quality. In particular, we consider planar graphs with costs and weights on the vertices, where weights are used to estimate the sizes of the partitions and costs are used to estimate the size of the separator. We show that in these graphs one can always find a small cost separator (consisting of vertices or edges) that partitions the graph into components of bounded weight. We describe implementations of the partitioning algorithms and discuss results of our experiments. © 2006 ACM.