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

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

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references