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

From MaRDI portal
Revision as of 21:51, 26 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57359911, #quickstatements; #temporary_batch_1706298242642)
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references