An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288)

From MaRDI portal
Revision as of 21:35, 5 July 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 efficient parallel algorithm for computing a large independent set in a planar graph
scientific article

    Statements

    An efficient parallel algorithm for computing a large independent set in a planar graph (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    planar graphs
    0 references
    independent set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references