Computing extremal and approximate distances in graphs having unit cost edges (Q1145636)
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: Computing extremal and approximate distances in graphs having unit cost edges |
scientific article; zbMATH DE number 3696860
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing extremal and approximate distances in graphs having unit cost edges |
scientific article; zbMATH DE number 3696860 |
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
