Novel approaches to placement

This paper was motivated by recent research in placement algorithms for VLSI circuits and attempts to visualize the connectivity and underlying physics associated with large networks or Internets. In both cases, these are graph problems made difficult by the inherent complexity of the problem (NPC) in conjunction with the size of the problem. In this work we present two useful alternatives for the layout of a graph in a manner as planar as possible. The conjecture being that if the initial placement or drawing is as close planar as possible it makes for more efficient post or subsequent processing. The notion which makes these methods potentially attractive here are in part due to the underlying application where there is a dichotomy in types of nodes being placed