Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (Q2965515)

From MaRDI portal
Revision as of 11:47, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    0 references
    0 references
    3 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    subgraph isomorphism
    0 references
    0 references
    0 references
    Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). (English)
    0 references