An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (Q3745299)

From MaRDI portal
Revision as of 12:00, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem
scientific article

    Statements

    title
    An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (English)
    0 references
    author
    Tang Jian
    0 references
    publication date
    1986
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C35
    0 references
    zbMATH DE Number
    3980507
    0 references
    zbMATH Keywords
    case analysis
    0 references
    deterministic upper bound
    0 references
    NP-completeness
    0 references
    Wikidata QID
    Q56210422
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3745299&oldid=17268164"
    Powered by MediaWiki