Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
0912.4584
Cited By
A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem
23 December 2009
Brijnesh J. Jain
Klaus Obermayer
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem"
1 / 1 papers shown
Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem
Brijnesh J. Jain
Klaus Obermayer
129
12
0
06 Jan 2011
1
Page 1 of 1
