Login / Signup
Linear-time algorithms for problems on planar graphs with fixed disk dimension.
Faisal N. Abu-Khzam
Michael A. Langston
Published in:
Inf. Process. Lett. (2007)
Keyphrases
</>
planar graphs
optimization problems
vertex cover
worst case
combinatorial optimization
computational complexity
problems in computer vision
pairwise
model selection