Solving the maximum edge-weight clique problem in sparse graphs with compact formulations.

Luis Eduardo Neves Gouveia Pedro Martins

Published in: EURO J. Comput. Optim. (2015)

Keyphrases

edge weights
bipartite graph
weighted graph
graph clustering
minimum spanning tree
directed graph
shortest path
total weight
high dimensional
graph theory
spanning tree
object recognition
minimum weight
quasi cliques
bayesian networks
maximum clique
undirected graph
superpixels
random walk
markov chain