Sciweavers

    40 search results - page 1 / 8
    » Intractability of Clique-Width Parameterizations
    Sort
    View
    SIAMCOMP
    2010
    135views more  SIAMCOMP 2010»
    Intractability of Clique-Width Parameterizations
    12 years 11 months ago
    Intractability of Clique-Width Parameterizations
    Download  www.ii.uib.no
    We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
    Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
    claim paper
    Read More »
    SODA
    2010
    ACM
    171views Algorithms» more  SODA 2010»
    On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second Order Logic
    14 years 2 months ago
    On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second Order Logic
    Download  web.comlab.ox.ac.uk
    Stephan Kreutzer, Siamak Tazari
    claim paper
    Read More »
    AAAI
    2008
    132views Intelligent Agents» more  AAAI 2008»
    Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
    13 years 7 months ago
    Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
    Download  www.aaai.org
    The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
    Yong Gao
    claim paper
    Read More »
    MST
    2006
    149views more  MST 2006»
    Parameterized Intractability of Distinguishing Substring Selection
    13 years 4 months ago
    Parameterized Intractability of Distinguishing Substring Selection
    Download  theinf1.informatik.uni-jena.de
    A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
    Jens Gramm, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    CJ
    2008
    75views more  CJ 2008»
    On Parameterized Intractability: Hardness and Completeness
    13 years 4 months ago
    On Parameterized Intractability: Hardness and Completeness
    Download  faculty.cs.tamu.edu
    Jianer Chen, Jie Meng
    claim paper
    Read More »
    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.