Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 22:25, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications |
scientific article |
Statements
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (English)
0 references
5 May 2017
0 references
enumeration of all maximal cliques
0 references
branch-and-bound depth-first search algorithms
0 references
