Clique detection for nondirected graphs: Two new algorithms (Q1143177): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 08:48, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clique detection for nondirected graphs: Two new algorithms |
scientific article |
Statements
Clique detection for nondirected graphs: Two new algorithms (English)
0 references
1979
0 references
nondirected graphs
0 references
algorithms
0 references
tree search algorithms
0 references
maximal complete subgraphs
0 references
cliques
0 references
parallel processing
0 references
