Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200)

From MaRDI portal
Revision as of 13:35, 3 July 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
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search
scientific article

    Statements

    Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    BSP/CGM algorithm
    0 references
    PRAM algorithm
    0 references
    circle graph
    0 references
    maximal clique
    0 references
    unrestricted depth search
    0 references
    0 references