加载中…
2014-02-21
A Polynomial Time Solution to the Clique Problem
Pawan TamtaB. P. PandeH. S. Dhami
文献摘要
The Clique Problem has a reduction to the Maximum Flow Network Interdiction Problem. We review the reduction to evolve a polynomial time algorithm for the Clique Problem. A computer program in C language has been written to validate the easiness of the algorithm.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本