On the complexity of submap isomorphism and maximum common submap problems (Q1677051)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of submap isomorphism and maximum common submap problems
scientific article

    Statements

    On the complexity of submap isomorphism and maximum common submap problems (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    generalized map
    0 references
    submap isomorphism
    0 references
    maximum common submap
    0 references
    complexity
    0 references
    plane graph
    0 references
    fixed-parameter tractable (FPT)
    0 references
    0 references
    0 references