加载中…
2011-01-06
Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem
Brijnesh JainKlaus Obermayer
文献摘要
This contribution extends the Bron Kerbosch algorithm for solving the maximum weight clique problem, where continuous-valued weights are assigned to both, vertices and edges. We applied the proposed algorithm to graph matching problems.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本