首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > Python > 一种求解最大割问题的Python库

一种求解最大割问题的Python库

资 源 简 介

For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem. We implemented optimized algorithms for finding exact solutions to the problem together with a spectral theory approach by Luca Trevisan for finding approximated solutions in polynomial time.

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP