Pages that link to "Item:Q1166425"

The following pages link to Most vital links and nodes in weighted networks (Q1166425):

Displaying 48 items.

• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• An extended network interdiction problem for optimal toll control (Q325471) (← links)
• A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
• Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
• Super edge magic graceful graphs (Q508670) (← links)
• An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
• NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
• Finding an anti-risk path between two nodes in undirected graphs (Q732313) (← links)
• Efficient algorithms for game-theoretic betweenness centrality (Q899439) (← links)
• On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
• Finding the anti-block vital edge of a shortest path between two nodes (Q1016036) (← links)
• The k most vital arcs in the shortest path problem (Q1119183) (← links)
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410) (← links)
• The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs (Q1198968) (← links)
• The most vital edges in the minimum spanning tree problem (Q1209313) (← links)
• The fuzzy shortest path problem and its most vital arcs (Q1315875) (← links)
• The single most vital arc in the most economical path problem -- a parametric analysis (Q1317083) (← links)
• Interdicting the activities of a linear program -- a parametric analysis (Q1390246) (← links)
• Finding the most vital node of a shortest path. (Q1401266) (← links)
• The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
• Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
• Finding the most vital arcs in a network (Q1823164) (← links)
• The complexity of finding small separators in temporal graphs (Q2009634) (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
• On the hardness of covering-interdiction problems (Q2031041) (← links)
• The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
• Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
• A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
• Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
• Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update (Q2424803) (← links)
• An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
• Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools (Q2803991) (← links)
• Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027) (← links)
• Minimizing a stochastic maximum-reliability path (Q3184595) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Selected Topics in Critical Element Detection (Q5260999) (← links)
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• Assistance and interdiction problems on interval graphs (Q6094722) (← links)