A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs (Q3404455)

From MaRDI portal
Revision as of 03:13, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
scientific article

    Statements

    title
    A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs (English)
    0 references
    author
    Mingyu Xiao
    0 references
    publication date
    9 February 2010
    0 references
    Mathematics Subject Classification ID
    68W05
    0 references
    05C85
    0 references
    68W40
    0 references
    zbMATH DE Number
    5667874
    0 references
    OpenAlex ID
    W1526809436
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3404455&oldid=32950920"
    Powered by MediaWiki