A fast parallel algorithm to recognize partitionable graphs (Q917295)

From MaRDI portal
Revision as of 18:10, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A fast parallel algorithm to recognize partitionable graphs
scientific article

    Statements

    title
    A fast parallel algorithm to recognize partitionable graphs (English)
    0 references
    publication date
    1990
    0 references
    zbMATH DE Number
    4155885
    0 references
    zbMATH Keywords
    NC algorithms
    0 references
    brittle graphs
    0 references
    EREW parallel random access machine
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q917295&oldid=12880643"
    Powered by MediaWiki