Computing extremal and approximate distances in graphs having unit cost edges (Q1145636): Difference between revisions
From MaRDI portal
Added link to MaRDI 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.1007/bf00264532 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019730496 / rank | |||
Normal rank | |||
Latest revision as of 08:43, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing extremal and approximate distances in graphs having unit cost edges |
scientific article |
Statements
Computing extremal and approximate distances in graphs having unit cost edges (English)
0 references
1981
0 references
binary search
0 references
Strassen-like matrix multiplication algorithm
0 references
unit cost (unweighted) edges
0 references
computation of distances
0 references
undirected graphs
0 references
