A preliminary analysis of the distance based critical node problem (Q510911): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.10.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2550848430 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hybrid constructive heuristics for the critical node problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A genetic algorithm for a class of critical node problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Detecting critical nodes in sparse graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A faster algorithm for betweenness centrality* / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Experimental analysis of dynamic all pairs shortest path algorithms / rank | |||
Normal rank | |||
Latest revision as of 09:58, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A preliminary analysis of the distance based critical node problem |
scientific article |
Statements
A preliminary analysis of the distance based critical node problem (English)
0 references
14 February 2017
0 references
critical node problem
0 references
graph fragmentation
0 references
shortest paths
0 references
