Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem
classification
💻 cs.DS
cs.CV
keywords
algorithmbroncliquekerboschmaximumproblemsolvingweight
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.