Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search (Q6202329)
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: Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search |
scientific article; zbMATH DE number 7824379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search |
scientific article; zbMATH DE number 7824379 |
Statements
Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search (English)
0 references
26 March 2024
0 references
critical node problem
0 references
memetic search
0 references
instance reduction
0 references
reduce-solve-combine
0 references
heuristic search
0 references
0.7904799580574036
0 references
0.778251051902771
0 references
0.7743591070175171
0 references
0.7651237845420837
0 references
0.7571186423301697
0 references
