Pages that link to "Item:Q547128"

The following pages link to Complexity of the critical node problem over trees (Q547128):

Displaying 35 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• Minimum edge blocker dominating set problem (Q319914) (← links)
• Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490) (← links)
• A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
• A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
• Parameterized complexity of critical node cuts (Q517024) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
• Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Complexity of the multilevel critical node problem (Q2121476) (← links)
• On critical node problems with vulnerable vertices (Q2169985) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
• VNS solutions for the critical node problem (Q2631225) (← links)
• Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
• The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
• The connected critical node problem (Q2672625) (← links)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
• A Region Growing Algorithm for Detecting Critical Nodes (Q2942434) (← links)
• A Fast Greedy Algorithm for the Critical Node Detection Problem (Q2942435) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)