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

From MaRDI portal
Revision as of 11:09, 12 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
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

    title
    An efficient parallel algorithm for computing a large independent set in a planar graph (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    1991
    0 references
    zbMATH Keywords
    planar graphs
    0 references
    independent set
    0 references

    Identifiers

    DOI
    10.1007/BF01759072
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68W15
    0 references
    05C85
    0 references
    zbMATH DE Number
    4209633
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q808288&oldid=20808198"
    Powered by MediaWiki