Parallel maximum clique algorithms with applications to network analysis (Q3447472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6499028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel maximum clique algorithms with applications to network analysis |
scientific article; zbMATH DE number 6499028 |
Statements
Parallel Maximum Clique Algorithms with Applications to Network Analysis (English)
0 references
27 October 2015
0 references
parallel maximum clique algorithms
0 references
branch-and-bound
0 references
network analysis
0 references
temporal strong components
0 references
graph compression
0 references
0 references
0 references
0 references
0 references
0 references
0.8604065775871277
0 references
0.850779116153717
0 references
0.8230957388877869
0 references
0.8096538186073303
0 references
0.8079237341880798
0 references
