An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812)

From MaRDI portal
Revision as of 06:53, 19 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An approximation algorithm for the maximum independent set problem in cubic planar graphs
scientific article

    Statements

    An approximation algorithm for the maximum independent set problem in cubic planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    polynomial time approximation algorithm
    0 references
    maximal independent set
    0 references
    cubic planar graphs
    0 references