Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time (Q5002715)
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: Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time |
scientific article; zbMATH DE number 7375969
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time |
scientific article; zbMATH DE number 7375969 |
Statements
28 July 2021
0 references
graph theory
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time (English)
0 references
