Filtering edge for exploration of large graphs

Abstract

Visual clutter in the layout of a large graph is mainly caused by the overwhelming number of edges. Filtering is one of ways to reduce the clutter. We regard a filtered graph as the compressed one of an original graph. Based on this view, a filtering approach is presented to reduce the visual clutter of a layout in a way that hidden patterns can be revealed gradually. The experiments have demonstrated the performance of the proposed approach in our prototype system. As evidenced by real examples, the system allows users to explore a graph at adjustable, continuous levels of details in an interactive way. This new approach is able to reveal more hidden patterns in graphs than existing approaches, providing a new way to gain insights into graph data.