Pages that link to "Item:Q2444525"

The following pages link to Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525):

Displaying 39 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 via a critical disruption path: branch-and-price algorithms (Q336604) (← 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)
• Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• Parameterized complexity of critical node cuts (Q517024) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections (Q1756351) (← links)
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Complexity of the multilevel critical node problem (Q2121476) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• On critical node problems with vulnerable vertices (Q2169985) (← links)
• Influential node detection of social networks based on network invulnerability (Q2212967) (← links)
• On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← 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 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)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• The firebreak problem (Q6065343) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• Min–max optimization of node‐targeted attacks in service networks (Q6196869) (← links)
• On critical node problems with vulnerable vertices (Q6616219) (← links)
• The critical node game (Q6645160) (← links)