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\.
机构:
Bharathiar Univ, Ctr Res & Dev, Coimbatore 641046, Tamil Nadu, India
Dept Math, Coimbatore 641402, Tamil Nadu, IndiaBharathiar Univ, Ctr Res & Dev, Coimbatore 641046, Tamil Nadu, India
Mohanapriya, N.
Kumar, S. Vimal
论文数: 0引用数: 0
h-index: 0
机构:
Dept Math, Coimbatore 641402, Tamil Nadu, IndiaBharathiar Univ, Ctr Res & Dev, Coimbatore 641046, Tamil Nadu, India
Kumar, S. Vimal
Vivin, J. Vernold
论文数: 0引用数: 0
h-index: 0
机构:
Anna Univ, Constituent Coll, Univ Coll Engn Nagercoil, Dept Math, Nagercoil 629004, Tamil Nadu, IndiaBharathiar Univ, Ctr Res & Dev, Coimbatore 641046, Tamil Nadu, India
Vivin, J. Vernold
Venkatachalam, M.
论文数: 0引用数: 0
h-index: 0
机构:
Dept Math, Coimbatore 641402, Tamil Nadu, IndiaBharathiar Univ, Ctr Res & Dev, Coimbatore 641046, Tamil Nadu, India