Sciweavers

    JDA
    2006
    59views more  JDA 2006»

    A note on the complexity of minimum dominating set

    13 years 11 months ago
    A note on the complexity of minimum dominating set
    Download  www.dsi.uniroma1.it
    The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
    Fabrizio Grandoni
    claim paper
    Added 13 Dec 2010
    Updated 13 Dec 2010
    Type Journal
    Year 2006
    Where JDA
    Authors Fabrizio Grandoni
    Comments (0)
    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.