Drawing the AS Graph in 2.5 Dimensions

We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-cores are represented by 2D layouts whose interdependence for increasing k is displayed by the third dimension. For the core with maximum value a spectral layout is chosen thus emphasizing on the most important part of the AS graph. The lower cores are added iteratively by force-based methods. In contrast to alternative approaches to visualize AS graph data, our method illustrates the entire AS graph structure. Moreover, it is generic with regard to the hierarchy displayed by the third dimension.

• Type: Conference
• Year: 2004
• Where: GD
• Authors: Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner
• Keywords: GD 2004, Graph Data, Graph Structure, Pure Graph Structure