Faster Algorithms for All Pairs Non-Decreasing Paths Problem (Q5091202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7561541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster Algorithms for All Pairs Non-Decreasing Paths Problem |
scientific article; zbMATH DE number 7561541 |
Statements
21 July 2022
0 references
graph optimization
0 references
matrix multiplication
0 references
non-decreasing paths
0 references
0 references
0 references
Faster Algorithms for All Pairs Non-Decreasing Paths Problem (English)
0 references
0.9417783617973328
0 references
0.83592289686203
0 references
0.8229024410247803
0 references
0.8159419894218445
0 references
