Sciweavers

Share
CATS   2006
Wall of Fame | Most Viewed CATS-2006 Paper
CATS
2006
11 years 6 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source167
2Download preprint from source135
3Download preprint from source127
4Download preprint from source126
5Download preprint from source110
6Download preprint from source108
7Download preprint from source107
8Download preprint from source106
9Download preprint from source105
10Download preprint from source94
11Download preprint from source94
12Download preprint from source91
13Download preprint from source89
14Download preprint from source87
15Download preprint from source85
16Download preprint from source74
books