An image of the hybrid grid layout algorithm.

<p>A. An ordinary or preprocessor algorithm draws a network map where the node labels may overlap. B. An approximate pattern matching algorithm finds a one-to-one, exclusive correspondence between a set (pattern) of graph nodes and a set of the grid points with the minimum axis-parallel insertions and deletions of space. C. The spaces of text labels are ensured.