An FPT Algorithm for Minimum Additive Spanner Problem. (Q5874282)
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 7650896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT Algorithm for Minimum Additive Spanner Problem. |
scientific article; zbMATH DE number 7650896 |
Statements
7 February 2023
0 references
graph algorithms
0 references
fixed-parameter tractability
0 references
graph spanner
0 references
An FPT Algorithm for Minimum Additive Spanner Problem. (English)
0 references
0.86589915
0 references
0 references
0.8566871
0 references
0.8566871
0 references
0.85269034
0 references
0.8511083
0 references
0.85068536
0 references
0.85068536
0 references
0.8506812
0 references
