Efficient parameterized algorithms for computing all-pairs shortest paths (Q5874311)
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 7650923
| 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 7650923 |
Statements
7 February 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.9939767718315125
0 references
0.8072338700294495
0 references
0.7966982126235962
0 references
0.7768273949623108
0 references
0.7764715552330017
0 references
