A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125)

From MaRDI portal
Revision as of 10:33, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parllel algorithm for finding a maximum weight clique of an interval graph
scientific article

    Statements

    A parllel algorithm for finding a maximum weight clique of an interval graph (English)
    0 references
    0 references
    1990
    0 references
    parallel algorithm
    0 references
    parallel random access machine
    0 references
    complexity analysis
    0 references
    EREW-PRAM
    0 references
    maximum weight clique
    0 references
    interval graph
    0 references

    Identifiers