For decades computer scientists had been trying to develop a fast algorithm for determining when it’s possible to add edges to a graph so that it remains “planar,” meaning none of its edges cross each ...

4.1: know the terminology of local search ... by hand on a tree or graph. Writing pseudocode, e.g. pseudocode versions of important algorithms. Short answer, true/false, multiple choice, etc. This is ...