Pages that link to "Item:Q5301395"

The following pages link to NP-completeness of the Planar Separator Problems (Q5301395):

Displaying 18 items.

• An exact algorithm for solving the vertex separator problem (Q628743) (← links)
• A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
• \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs (Q1179551) (← links)
• Finding good approximate vertex and edge partitions is NP-hard (Q1198051) (← links)
• A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
• On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
• The vertex \(k\)-cut problem (Q2419357) (← links)
• Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
• Separation of NP-completeness notions (Q2784487) (← links)
• Knowledge Discovery in Graphs Through Vertex Separation (Q3305126) (← links)
• The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
• (Q4373672) (← links)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
• Computation in Causal Graphs (Q5377356) (← links)
• On Some $\mathcal{NP}$ -complete SEFE Problems (Q5746258) (← links)
• Balanced line separators of unit disk graphs (Q5918796) (← links)