Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940)

From MaRDI portal
Revision as of 14:16, 11 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
scientific article

    Statements

    Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references