Login / Signup
New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut.
Amir Abboud
Vincent Cohen-Addad
Philip N. Klein
Published in:
CoRR (2020)
Keyphrases
</>
worst case
computational complexity
dynamic programming
planar graphs
objective function
k means
optimal solution
linear programming
np hard
special case
probabilistic model
graph structure