Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications |
scientific article; zbMATH DE number 6711873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications |
scientific article; zbMATH DE number 6711873 |
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
0 references
0 references
0.9406793
0 references
0.93874466
0 references
0.93697166
0 references
0.9339663
0 references
0 references
0.93003786
0 references
0.9299054
0 references
0.92921466
0 references
