Login / Signup
A fast algorithm for the maximum weight clique problem.
Luitpold Babel
Published in:
Computing (1994)
Keyphrases
</>
maximum weight
bipartite matching
bipartite graph
minimum weight
independent set
partial order
weighted graph
np hard
bipartite graph matching
social networks
data model
probabilistic model
shortest path