Hint for Homework 1 Sorting and Divide-and-Conquer
Hint for Problem 1 not work !!!
Hint for Problem 8 (2) (3)
Planar Graph Separator Tarjan-Lipton Theorem (1979)
Example Dijkstra’s algorithm can find the shortest path from s to t in time O((n+m) log n) where n is # of nodes and m is # of edges.
Planar Graph induction Exercise