NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00172-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000869287 / rank | |||
Normal rank | |||
Latest revision as of 10:15, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NC algorithms for the Single Most Vital Edge problem with respect to shortest paths |
scientific article |
Statements
NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (English)
0 references
28 February 1997
0 references
Algorithms
0 references
Parallel processing
0 references
NC algorithms
0 references
0 references
