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):

Displayed 11 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)
• 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)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) ‎ (← links)