Sciweavers

    7 search results - page 2 / 2
    » Solving Dominating Set in Larger Classes of Graphs: FPT Algo...
    Sort
    View
    FSTTCS
    2009
    Springer
    125views Software Engineering» more  FSTTCS 2009»
    Subexponential Algorithms for Partial Cover Problems
    14 years 26 days ago
    Subexponential Algorithms for Partial Cover Problems
    Download  www.ii.uib.no
    Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
    Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
    claim paper
    Read More »
    CIE
    2007
    Springer
    161views Applied Computing» more  CIE 2007»
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
    14 years 15 days ago
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
    Download  www.ii.uib.no
    In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
    Michael R. Fellows, Frances A. Rosamond
    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.