Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

Add code
Jan 06, 2011
Brijnesh Jain, Klaus Obermayer
Figure 1 for Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem
Figure 2 for Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

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.

View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon