Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (Q2965515): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962884946 / rank | |||
Normal rank | |||
| Property / title | |||
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (English) | |||
| Property / title: Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (English) / rank | |||
Normal rank | |||
Latest revision as of 11:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
