Let G be a graph of order n and let S be any subset of the vertex set V (G). Denote by GS the graph obtained from the graph G by adding a new vertex x which is adjacent exactly to the vertices from S.

In this paper, we describe three graph theoretic heuristics that attempt to determine an optimal planar adjacency graph from a REL chart. Our computational experience suggests that these methods can ...