Computing independent sets in graphs with large girth (Q1183338)

From MaRDI portal
Revision as of 15:45, 15 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing independent sets in graphs with large girth
scientific article

    Statements

    title
    Computing independent sets in graphs with large girth (English)
    0 references
    publication date
    28 June 1992
    0 references
    Mathematics Subject Classification ID
    05C35
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    33083
    0 references
    zbMATH Keywords
    girth
    0 references
    independent set
    0 references
    NP-complete
    0 references
    polynomial time approximation algorithm
    0 references
    author
    O. J. Murphy
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1183338&oldid=34084109"
    Powered by MediaWiki