graph partitioning;
bisection width;
regular graphs;
local improvement;
D O I:
暂无
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
We derive new upper bounds on the bisection width of graphs which have a regular vertex degree. We show that the bisection width of large 3-regular graphs with \V\ vertices is at most 1/6\V\. For the bisection width of large 4-regular graphs we show an upper 6 bound of 2/5\V\.
机构:
Department of Computer Science, KU Leuven Campus Kulak-Kortrijk, Kortrijk,8500, BelgiumDepartment of Computer Science, KU Leuven Campus Kulak-Kortrijk, Kortrijk,8500, Belgium