Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Stony Brook / rank | |||
Normal rank | |||
Revision as of 01:44, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem |
scientific article |
Statements
Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (English)
0 references
15 November 2012
0 references
critical node detection
0 references
complex networks
0 references
random graph
0 references
simulated annealing
0 references
population-based incremental learning
0 references
