Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2021.105254 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2021.105254 / rank | |||
Normal rank | |||
Latest revision as of 15:10, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient methods for the distance-based critical node detection problem in complex networks |
scientific article |
Statements
Efficient methods for the distance-based critical node detection problem in complex networks (English)
0 references
7 March 2022
0 references
critical node problem
0 references
distance connectivity
0 references
integer programming
0 references
lazy constraints
0 references
breadth first search
0 references
0 references
0 references
0 references
0 references
