Graph motif problems parameterized by dual (Q5369540)
From MaRDI portal
!
WARNING
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 6792416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph motif problems parameterized by dual |
scientific article; zbMATH DE number 6792416 |
Statements
17 October 2017
0 references
NP-hard problem
0 references
subgraph problem
0 references
fixed-parameter algorithm
0 references
lower bounds
0 references
kernelization
0 references
0.9921703934669496
0 references
0.856910228729248
0 references
0.8511731028556824
0 references
0.8395276665687561
0 references
0.8265502452850342
0 references
