Detecting a most closeness-central clique in complex networks (Q2286965)
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 7156950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting a most closeness-central clique in complex networks |
scientific article; zbMATH DE number 7156950 |
Statements
Detecting a most closeness-central clique in complex networks (English)
0 references
23 January 2020
0 references
networks
0 references
closeness centrality
0 references
clique
0 references
NP-completeness
0 references
exact algorithms
0 references
0.8413498997688293
0 references
0.8326280117034912
0 references
0.8006293177604675
0 references
0.7872398495674133
0 references
0.755037248134613
0 references
