An Analysis of Heuristics for Graph

Abstract

We analyze several heuristics for graph planarization, i.e., deleting the minimum number of edges from a nonplanar graph to make it planar. The problem is NP-hard, although some 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 a… (More)

Topics

4 Figures and Tables