Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155)
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 7764549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.9939767718315125
0 references
0.8110616207122803
0 references
0.8027886748313904
0 references
0.7829040288925171
0 references
0.7827627658843994
0 references
