On parameterized complexity of the multi-MCS problem (Q1019178)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On parameterized complexity of the multi-MCS problem |
scientific article; zbMATH DE number 5558985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On parameterized complexity of the multi-MCS problem |
scientific article; zbMATH DE number 5558985 |
Statements
On parameterized complexity of the multi-MCS problem (English)
0 references
28 May 2009
0 references
algorithms
0 references
maximum common subgraph
0 references
parameterized complexity
0 references
linear FPT reduction
0 references
0.9398426
0 references
0.87244976
0 references
0.87021136
0 references
0.87021136
0 references
0.8697696
0 references
0.8697696
0 references
0.8610531
0 references
