Sciweavers

    ESA
    2009
    Springer
    131views Algorithms» more  ESA 2009»
    Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
    15 years 10 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
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.