524 search results - page 18 / 105 » On the Maximum Number of Cliques in a Graph |
177
click to vote
TCS
2010
15 years 4 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
186
click to vote
AAAI
2012
13 years 8 months ago
2012
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
202
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
141
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...