Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:46, 3 February 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
1 December 2010
0 references
BSP/CGM algorithm
0 references
PRAM algorithm
0 references
circle graph
0 references
maximal clique
0 references
unrestricted depth search
0 references
