A fast greedy algorithm for the critical node detection problem (Q2942435)
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 6480674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast greedy algorithm for the critical node detection problem |
scientific article; zbMATH DE number 6480674 |
Statements
A Fast Greedy Algorithm for the Critical Node Detection Problem (English)
0 references
11 September 2015
0 references
0.8793459534645081
0 references
0.8550184369087219
0 references
0.8284098505973816
0 references
0.8232975602149963
0 references
0.8214866518974304
0 references
