New Methods and Tools for Visualizing Graphs

Keywords: Graphs networks visualization

Abstract: We present a new method for visualizing graphs which facilitates understanding the graphs' clique structure and edges between the cliques. At face value, the method presumes that the clique structure and edges between cliques have been determined algorithmically. Since the finding of just the maximum clique, let alone the entire structure, is a well known NP-Complete problem, algorithmic solutions, though straightforward, are feasible only for relatively small graphs involving fewer than say 50 or so nodes. Possible methods to visually discover the clique structure of larger graphs are discussed.

In addition, new tools for visually discovering the clique structure of a graph visualized via the well known matrix representation are also presented.