1,721,058 research outputs found

    A review of recent heuristic algorithms for the Critical Node Problem

    No full text
    We will review several heuristic algorithms we proposed recently to solve different versions of the Critical Node Problem (CNP), i.e. the maximal fragmentation of a graph G given a connectivity measure, that improve the solution quality greatly over existing competitor
    corecore