Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696)

From MaRDI portal
Revision as of 22:11, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6107806
Language Label Description Also known as
English
Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
scientific article; zbMATH DE number 6107806

    Statements

    Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    critical node problem
    0 references
    tree
    0 references
    series-parallel graph
    0 references
    dynamic programming
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references