Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Coarse-grained parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel graph algorithms for coarse-grained multicomputers and BSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel search algorithm for directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and efficient circle graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconnaissance des graphes de cordes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Latest revision as of 13:35, 3 July 2024

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