Login / Signup
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs.
Ryo Ashida
Tatsuya Imai
Kotaro Nakagawa
A. Pavan
N. V. Vinodchandran
Osamu Watanabe
Published in:
Electron. Colloquium Comput. Complex. (2019)
Keyphrases
</>
planar graphs
objective function
k means
worst case
computational complexity
closed form
optimal solution
dynamic programming
stereo matching
probabilistic model
linear programming
linear program
piecewise linear
minimum weight