I/O-optimal algorithms for planar graphs using separators.

Anil Maheshwari Norbert Zeh

Published in: SODA (2002)

Keyphrases

planar graphs
worst case
computational complexity
optimization problems
knapsack problem