Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths (Q4277537): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0222071 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2133768189 / rank | |||
Normal rank | |||
Latest revision as of 23:42, 19 March 2024
scientific article; zbMATH DE number 495788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths |
scientific article; zbMATH DE number 495788 |
Statements
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths (English)
0 references
7 February 1994
0 references
all-pairs shortest paths
0 references
weighted graphs
0 references
lower bound
0 references
path comparison
0 references
random graphs
0 references
