Before revision:  In this scenario, vertex-vertex and edge-vertex overlaps cause visual clutter and may generate ambiguities. Since such issues can be solved by scaling up the drawingby a suitable factor , we present constructive techniques that yield more compact upper bounds for the area requirements of disk-link drawings for several (planar and nonplanar) graph classes, including proper level, bounded bandwidth, complete, planar and outerplanar graphs .
After revision:  In this scenario, vertex-vertex and edge-vertex resolution, namely \rho=\frac{1 , we present constructive techniques that yield more compact upper bounds for the area requirements of disk-link drawings for several (planar and nonplanar) graph classes, including proper level, bounded bandwidth, complete, planar and outerplanar graphs .