2
votes
Accepted
Finding a Maximum Cut With Force Labeled Vertices for Planar Graphs
A special case of your problem, where the neighborhoods of the vertices you force together are disjoint, is equivalent to solving (regular) Max-Cut on an apex graph (a graph that is planar, save for ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
planar-graphs × 70graphs × 57
algorithms × 19
computational-geometry × 9
complexity-theory × 4
optimization × 3
reference-request × 3
parameterized-complexity × 3
voronoi-diagrams × 3
runtime-analysis × 2
approximation × 2
discrete-mathematics × 2
enumeration × 2
partitions × 2
square-grid × 2
connected × 2
duality × 2
time-complexity × 1
algorithm-analysis × 1
regular-languages × 1
finite-automata × 1
np-complete × 1
reductions × 1
dynamic-programming × 1
trees × 1