Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764)

From MaRDI portal
Revision as of 11:49, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
scientific article

    Statements

    Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    graph deletion problems
    0 references
    approximation algorithms
    0 references
    primal-dual
    0 references
    0 references