FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425)

From MaRDI portal
scientific article
Language Label Description Also known as
English
FPT algorithms to compute the elimination distance to bipartite graphs and more
scientific article

    Statements

    FPT algorithms to compute the elimination distance to bipartite graphs and more (English)
    0 references
    0 references
    0 references
    8 June 2022
    0 references
    0 references
    elimination distance
    0 references
    FPT
    0 references
    odd cycle transversal
    0 references
    0 references
    0 references