Maintaining shortest paths under deletions in weighted directed graphs (Q5495843): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (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.1145/2488608.2488701 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975344016 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:23, 19 March 2024
scientific article; zbMATH DE number 6327007
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maintaining shortest paths under deletions in weighted directed graphs |
scientific article; zbMATH DE number 6327007 |
Statements
Maintaining shortest paths under deletions in weighted directed graphs (English)
0 references
7 August 2014
0 references
approximation algorithms
0 references
dynamic algorithms
0 references
shortest paths
0 references
