Bounds on Mincut for Cayley Graphs over Abelian Groups

Theory of Computing Systems（2008）

引用 2|浏览0

暂无评分

摘要

In this paper we find upper bounds for the mincut value of Cayley graphs over abelian groups. These results provide a significant improvement of those in Annextein and Baumslag (Math. Syst. Theory 26(3):271–291, [ 1993 ]).

查看译文

关键词

Graph theory,Cayley graphs,Bisection,Mincut,Bounds,Algorithms,Combinatorial optimization

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要