Pages that link to "Item:Q5301395"
From MaRDI portal
The following pages link to NP-completeness of the Planar Separator Problems (Q5301395):
Displaying 11 items.
- An exact algorithm for solving the vertex separator problem (Q628743) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← 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)
- 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)
- Knowledge Discovery in Graphs Through Vertex Separation (Q3305126) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- Computation in Causal Graphs (Q5377356) (← links)
- Balanced line separators of unit disk graphs (Q5918796) (← links)
