NP-completeness of the Planar Separator Problems
From MaRDI portal
Publication:5301395
DOI10.7155/jgaa.00130zbMath1178.68378MaRDI QIDQ5301395
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/45389
68R10: Graph theory (including graph drawing) in computer science
Related Items
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, Computation in Causal Graphs, Balanced line separators of unit disk graphs, An exact algorithm for solving the vertex separator problem, A multilevel bilinear programming algorithm for the vertex separator problem, A quality and distance guided hybrid algorithm for the vertex separator problem, The critical node detection problem in networks: a survey, On integer and bilevel formulations for the \(k\)-vertex cut problem, The vertex \(k\)-cut problem, Continuous quadratic programming formulations of optimization problems on graphs, Knowledge Discovery in Graphs Through Vertex Separation