Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226)
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: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem |
scientific article; zbMATH DE number 6106630
| 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; zbMATH DE number 6106630 |
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
0 references
