Pages that link to "Item:Q4648696"

The following pages link to Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696):

Displaying 33 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• Analysis of complex network performance and heuristic node removal strategies (Q312858) (← links)
• Minimum edge blocker dominating set problem (Q319914) (← links)
• A genetic algorithm for a class of critical node problems (Q325485) (← 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)
• 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 critical node detection problem in networks: a survey (Q1750314) (← 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)
• Interdicting facilities in tree networks (Q2121611) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← 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)
• 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)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← 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)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• The firebreak problem (Q6065343) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)