A Fast Greedy Algorithm for the Critical Node Detection Problem (Q2942435): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_45 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W792477341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and cut algorithms for detecting critical nodes in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the critical node problem over trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound and exact methods for assessing link vulnerability in complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authoritative sources in a hyperlinked environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derandomized approximation algorithm for the critical node detection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm with local search for containment of pandemic disease spread / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact identification of critical nodes in sparse networks via new compact formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming framework for critical elements detection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 17:43, 10 July 2024

scientific article
Language Label Description Also known as
English
A Fast Greedy Algorithm for the Critical Node Detection Problem
scientific article

    Statements

    A Fast Greedy Algorithm for the Critical Node Detection Problem (English)
    0 references
    0 references
    0 references
    11 September 2015
    0 references

    Identifiers