Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

01/06/2011
by   Brijnesh Jain, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2022

Turán graphs with bounded matching number

We determine the maximum possible number of edges of a graph with n vert...
research
12/23/2009

A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

This paper formulates a necessary and sufficient condition for a generic...
research
08/21/2018

A Tutorial on Clique Problems in Communications and Signal Processing

Since its first use by Euler on the seven bridges of Königsberg problem,...
research
11/07/2020

ROBIN: a Graph-Theoretic Approach to Reject Outliers in Robust Estimation using Invariants

Many estimation problems in robotics, computer vision, and learning requ...
research
06/18/2012

The Most Persistent Soft-Clique in a Set of Sampled Graphs

When searching for characteristic subpatterns in potentially noisy graph...
research
10/03/2022

Reconciling econometrics with continuous maximum-entropy models

In the study of economic networks, econometric approaches interpret the ...
research
02/18/2020

Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem

We develop an FPT algorithm and a kernel for the Weighted Edge Clique Pa...

Please sign up or login with your details

Forgot password? Click here to reset