Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2023.07.029 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2999799760 / rank | |||
Normal rank | |||
Revision as of 09:25, 30 July 2024
scientific article; zbMATH DE number 7764549
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parameterized algorithms for computing all-pairs shortest paths |
scientific article; zbMATH DE number 7764549 |
Statements
Efficient parameterized algorithms for computing all-pairs shortest paths (English)
0 references
13 November 2023
0 references
all-pairs shortest paths
0 references
efficient parameterized algorithms
0 references
parameterized complexity
0 references
clique-width
0 references
modular-width
0 references
