首页 /研究 /A new branch-and-bound algorithm for the maximum edge-weighted clique problem
OTHER

A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubić

发表年份
2019
引用次数
29

关键词

Clique problemBounding overwatchVertex (graph theory)Branch and boundCliquePruningAlgorithmMathematicsEnhanced Data Rates for GSM EvolutionComputer science

相关论文

查看 OTHER 分类全部论文