NC algorithms for dynamically solving the all pairs shortest paths problem and related problems (Q1350623)
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: NC algorithms for dynamically solving the all pairs shortest paths problem and related problems |
scientific article; zbMATH DE number 984088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NC algorithms for dynamically solving the all pairs shortest paths problem and related problems |
scientific article; zbMATH DE number 984088 |
Statements
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems (English)
0 references
27 February 1997
0 references
Parallel algorithms
0 references
Partially dynamic graph algorithms
0 references
The all pairs shortest paths problem
0 references
The longest path problem
0 references
The transitive closure problem
0 references
Topological sorting
0 references
