首页> 美国政府科技报告 >Algorithms for the Maximum Clique Problem
【24h】

Algorithms for the Maximum Clique Problem

机译:最大团问题的算法

获取原文

摘要

Algorithms for the maximum clique problem are presented. The performance of the algorithms is evaluated, using computer implementations on several random graphs with up to 3000 vertices and over one million edges. As benchmarks, two algorithms are used that appeared to be the fastest algorithms known in the literature. The computational results suggest that the algorithms presented in the paper are faster than the algorithms in the literature.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号