Drawing the AS graph in 2.5 dimensions

29Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Baur, M., Brandes, U., Gaertler, M., & Wagner, D. (2004). Drawing the AS graph in 2.5 dimensions. In Lecture Notes in Computer Science (Vol. 3383, pp. 43–48). https://doi.org/10.1007/978-3-540-31843-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free