【作者(必填)】Akbari, Z.O.

【文题(必填)】A polynomial-time algorithm for the maximum clique problem

【年份(必填)】2013

【全文链接或数据库名称(选填)】

http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6607889&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6607889