Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.02.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2050675408 / rank | |||
Normal rank |
Revision as of 23:53, 19 March 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