Pages that link to "Item:Q4639693"

The following pages link to Complexity and approximability of the <i>k</i>‐way vertex cut (Q4639693):

Displaying 15 items.

• On the complexity of finding balanced oneway cuts (Q1014383) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
• The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• The vertex \(k\)-cut problem (Q2419357) (← links)
• The connected critical node problem (Q2672625) (← links)
• On the Parameterized Complexity of Cutting a Few Vertices from a Graph (Q2849930) (← links)
• (Q4607983) (← links)
• The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• The firebreak problem (Q6065343) (← links)
• Breaking the <i> n ^k </i> barrier for minimum <i>k</i> -cut on simple graphs (Q6083468) (← links)