Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

Details Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

2011-01-06

arxiv.org/abs/1101.1266v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-399979