Pages that link to "Item:Q5422013"

The following pages link to Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013):

Displaying 18 items.

• 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)
• Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
• Parliament seating assignment problems (Q2242347) (← links)
• Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• (Q5090422) (← links)
• Selected Topics in Critical Element Detection (Q5260999) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)