Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (Q5002719): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/9048/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2886888786 / rank | |||
Normal rank | |||
| Property / title | |||
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (English) | |||
| Property / title: Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (English) / rank | |||
Normal rank | |||
Latest revision as of 10:00, 30 July 2024
scientific article; zbMATH DE number 7375971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs |
scientific article; zbMATH DE number 7375971 |
Statements
28 July 2021
0 references
graph algorithms
0 references
matrix multiplication
0 references
non-decreasing paths
0 references
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (English)
0 references
