Sciweavers

    CATS   2008
    Wall of Fame | Most Viewed CATS-2008 Paper
    CATS
    2008
    270views Applied Computing» more  CATS 2008»
    Parameterized Complexity of the Clique Partition Problem
    13 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 source270
    Parameterized Complexity of the Clique Partition Problem
    claim
    2Download preprint from source265
    A Multidimensional Bisection Method for Unconstrained Minimization Problem
    claim
    3Download preprint from source261
    Well-covered Graphs and Greedoids
    claim
    4Download preprint from source248
    Tractable Cases of the Extended Global Cardinality Constraint
    claim
    5Download preprint from source246
    On the Efficiency of Pollard's Rho Method for Discrete Logarithms
    claim
    6Download preprint from source242
    Modelling for Lazy Clause Generation
    claim
    7Download preprint from source234
    Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value
    claim
    8Download preprint from source224
    Generating Balanced Parentheses and Binary Trees by Prefix Shifts
    claim
    9Download preprint from source216
    The Core Concept for 0/1 Integer Programming
    claim
    10Download preprint from source209
    Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
    claim
    11Download preprint from source207
    Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
    claim
    12Download preprint from source195
    On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
    claim
    13Download preprint from source186
    Weak Parametric Failure Equivalences and Their Congruence Formats
    claim
    14Download preprint from source181
    The Inhabitation Problem for Intersection Types
    claim
    15Download preprint from source176
    An ILP for the metro-line crossing problem
    claim
    16Download preprint from source175
    Testing Embeddability Between Metric Spaces
    claim
    17Download preprint from source172
    The Parameterized Complexity of Regular Subgraph Problems and Generalizations
    claim
    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 Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.