Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532)
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 7764301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem |
scientific article; zbMATH DE number 7764301 |
Statements
Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (English)
0 references
13 November 2023
0 references
fixed-parameter tractability
0 references
kernelization lower bounds
0 references
NP-hard problem
0 references
problem kernelization
0 references
subexponential time
0 references
treewidth
0 references
0 references
0 references
0 references
0 references
0 references
0.8434833288192749
0 references
0.8427646160125732
0 references
0.8016542792320251
0 references
0.7609300017356873
0 references
0.7468869686126709
0 references
