Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask) (Q2965515)
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: Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask) |
scientific article |
Statements
3 March 2017
0 references
parameterized complexity
0 references
subgraph isomorphism
0 references
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (English)
0 references
0.8282554149627686
0 references
0.816409170627594
0 references
0.8106252551078796
0 references
0.7989208698272705
0 references
0.7934185266494751
0 references
