An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (Q3954831)

From MaRDI portal
Revision as of 21:45, 19 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
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs
scientific article

    Statements

    An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    bounded worst case ratio
    0 references
    time-complexity
    0 references
    vertex-identification
    0 references
    0 references