Complexity of modification problems for reciprocal best match graphs (Q2290642)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of modification problems for reciprocal best match graphs
scientific article

    Statements

    Complexity of modification problems for reciprocal best match graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    reciprocal best matches
    0 references
    hierarchically colored cographs
    0 references
    orthology relation
    0 references
    bicluster graph
    0 references
    editing
    0 references
    NP-hardness
    0 references
    parameterized algorithms
    0 references
    0 references
    0 references
    0 references