Sciweavers

Share ➚
CATS   2008
Wall of Fame | Most Viewed CATS-2008 Paper
CATS
2008
112views Applied Computing» more  CATS 2008»
Parameterized Complexity of the Clique Partition Problem
1 years 6 months ago
Parameterized Complexity of the Clique Partition Problem
Download  crpit.com
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
claim paper
Read More »
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 source112
Parameterized Complexity of the Clique Partition Problem
claim
2Download preprint from source108
Well-covered Graphs and Greedoids
claim
3Download preprint from source80
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
claim
4Download preprint from source72
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
claim
5Download preprint from source72
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
claim
6Download preprint from source72
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
claim
7Download preprint from source70
Tractable Cases of the Extended Global Cardinality Constraint
claim
8Download preprint from source69
A Multidimensional Bisection Method for Unconstrained Minimization Problem
claim
9Download preprint from source68
Modelling for Lazy Clause Generation
claim
10Download preprint from source66
The Parameterized Complexity of Regular Subgraph Problems and Generalizations
claim
11Download preprint from source62
The Core Concept for 0/1 Integer Programming
claim
12Download preprint from source62
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
claim
13Download preprint from source60
Weak Parametric Failure Equivalences and Their Congruence Formats
claim
14Download preprint from source60
An ILP for the metro-line crossing problem
claim
15Download preprint from source59
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value
claim
16Download preprint from source58
The Inhabitation Problem for Intersection Types
claim
17Download preprint from source58
Testing Embeddability Between Metric Spaces
claim
Spread the Word
Explore & Download
Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
Productivity Tools
International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
Document Tools
PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
Image Tools
JPG to PS JPG to PDF Extract Images from PDF Image Converter
Sciweavers
About Community Report Bug Request Feature Privacy Policy Terms of Use Contact

Copyright © 2009-2011 Sciweavers LLC. All rights reserved.

books