Pages that link to "Item:Q1013394"
From MaRDI portal
The following pages link to Detecting critical nodes in sparse graphs (Q1013394):
Displaying 50 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)
- A genetic algorithm for a class of critical node problems (Q325485) (← 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)
- Information theory perspective on network robustness (Q341919) (← links)
- Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
- Social structure optimization in team formation (Q342472) (← 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)
- The topological defense in SIS epidemic models (Q508188) (← links)
- A preliminary analysis of the distance based critical node problem (Q510911) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Complexity of the critical node problem over trees (Q547128) (← links)
- A multi-criteria optimization model for humanitarian aid distribution (Q652675) (← links)
- A mathematical programming computational model for disproportionate collapse analysis of steel building frames (Q691388) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- An optimal approach for the critical node problem using semidefinite programming (Q1620469) (← 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)
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
- Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
- Wireless LAN transmitter location under the threat of jamming attacks (Q1734815) (← links)
- Efficient heuristic algorithm for identifying critical nodes in planar networks (Q1734834) (← links)
- Compact models for critical node detection in telecommunication networks (Q1742251) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Literature review: the vaccine supply chain (Q1754311) (← 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)
- Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← 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)
- A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
- Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
- Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← 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)
- Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
- VNS solutions for the critical node problem (Q2631225) (← links)
