116 citations · 626 across the 37 of their papers we have counts for
Showing 2009 · cs.AIShow all
2 papers · 2 filters
cs.AI2009★ 2 cited
Elkan's k-Means for Graphs
Brijnesh J. Jain, Klaus Obermayer
This paper extends k-means algorithms from the Euclidean domain to the domain of graphs. To recompute the centroids, we apply subgradient methods for solving the optimization-based…
cs.AI2009
A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem
Brijnesh Jain, Klaus Obermayer
This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived a…