Abstract
A recent paper by Boswell claims the development of a new greedy heuristic for constructing a maximal planar weighted graph. This paper points out that Boswell's procedure is not actually new since it has similiarity to an approach introduced earlier by Hassan and Hogg. The paper also points out the advantages of the Hassan and Hogg approach over Boswell's procedure.