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

From MaRDI portal
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