Most vital links and nodes in weighted networks
From MaRDI portal
Publication:1166425
DOI10.1016/0167-6377(82)90020-7zbMath0488.90069OpenAlexW2008423363MaRDI QIDQ1166425
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90020-7
Related Items (48)
Component-cardinality-constrained critical node problem in graphs ⋮ An extended network interdiction problem for optimal toll control ⋮ Minimizing a stochastic maximum-reliability path ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ The k most vital arcs in the shortest path problem ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ Interdicting the activities of a linear program -- a parametric analysis ⋮ The stochastic critical node problem over trees ⋮ Assistance and interdiction problems on interval graphs ⋮ Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update ⋮ Finding the most vital node of a shortest path. ⋮ Efficient algorithms for game-theoretic betweenness centrality ⋮ An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance ⋮ Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers ⋮ The tree longest detour problem in a biconnected graph. ⋮ On short paths interdiction problems: Total and node-wise limited interdiction ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ Finding the most vital edge with respect to minimum spanning tree in weighted graphs ⋮ The Complexity of Finding Small Separators in Temporal Graphs ⋮ NC algorithms for the Single Most Vital Edge problem with respect to shortest paths ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ Super edge magic graceful graphs ⋮ The critical node detection problem in networks: a survey ⋮ The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ An \(s\)-\(t\) connection problem with adaptability ⋮ The most vital edges in the minimum spanning tree problem ⋮ The complexity of finding small separators in temporal graphs ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm ⋮ On the hardness of covering-interdiction problems ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Perfect matching interdiction problem restricted to a stable vertex ⋮ Finding an anti-risk path between two nodes in undirected graphs ⋮ Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools ⋮ Finding the anti-block vital edge of a shortest path between two nodes ⋮ Finding the most vital arcs in a network ⋮ A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities ⋮ Selected Topics in Critical Element Detection ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire ⋮ The fuzzy shortest path problem and its most vital arcs ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback ⋮ The single most vital arc in the most economical path problem -- a parametric analysis
Cites Work
This page was built for publication: Most vital links and nodes in weighted networks
