Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
scientific article

    Statements

    Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2019
    0 references
    hypergraph
    0 references
    minimum \(\mathcal{F}\)-overlay problem
    0 references
    NP-completeness
    0 references
    fixed-parameter tractability
    0 references

    Identifiers

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