Sciweavers

    ESA
    2009
    Springer
    131views Algorithms» more  ESA 2009»
    Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
    14 years 7 months ago
    Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
    Download  www.imsc.res.in
    Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
    Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
    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.