We analyze several heuristics for nding a maximum planar subgraph of a nonplanar graph. The problem is NP-hard, although heuristics which perform well in practice have been reported. In particular, we compare the two principle methods, based on path addition and vertex addition, respectively , with an incremental method, a \cycle packing" approach, and a branch-and-cut algorithm. For the incre-...