CATS   2008
Wall of Fame | Most Viewed CATS-2008 Paper
9 years 4 months ago
Parameterized Complexity of the Clique Partition Problem
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
Egbert Mujuni, Frances A. Rosamond
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.
1Download preprint from source270
2Download preprint from source265
3Download preprint from source261
4Download preprint from source248
5Download preprint from source246
6Download preprint from source242
7Download preprint from source234
8Download preprint from source224
9Download preprint from source216
10Download preprint from source209
11Download preprint from source207
12Download preprint from source195
13Download preprint from source186
14Download preprint from source181
15Download preprint from source176
16Download preprint from source175
17Download preprint from source172