Multi-Circular Layout of Micro/Macro Graphs

Baur, Michael and Brandes, Ulrik (2008) Multi-Circular Layout of Micro/Macro Graphs. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 255-267 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_26).

Full text not available from this repository.

Abstract

We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced by a given partition of the micro-level vertices. A typical example is a social network of employees organized into different departments. We do not impose restrictions on the macro-level layout other than sufficient thickness of edges and vertices, so that the micro-level graph can be placed on top of the macro-level graph. For the micro-level graph we define a combinatorial multi-circular embedding and present corresponding layout algorithms based on edge crossing reduction strategies.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-77537-9_26
Classifications:P Styles > P.120 Circular
ID Code:843

Repository Staff Only: item control page

References

D. Archambault, T. Munzner, and D. Auber. Topolayout: Multi-level graph layout by topological features. IEEE Trans. Visual. and Comp. Graphics, 13(2):305-317, 2007.

C. Bachmaier. A radial adaptation of the sugiyama framework for visualizing hierarchical information. IEEE Trans. Visual. and Comp. Graphics, 13(3):585-594, 2007.

M. Balzer and O. Deussen. Level-of-detail visualization of clustered graph layouts. In Asia-Pacific Symposium on Visualisation 2007 (APVIS'07), 2007.

M. Baur and U. Brandes. Crossing reduction in circular layouts. In Proc. Workshop Graph-Theoretic Concepts in Comp. Science (WG'04), pp. 332-343. Springer, 2004.

U. Brandes and T. Erlebach, editors. Network Analysis: Methodological Foundations, volume 3418 of LNCS. Springer, 2005.

T. F. Cox and M. A. A. Cox. Multidimensional Scaling. Monographs on Statistics and Applied Probability. Chapman & Hall/CRC, 2nd edition, 2001.

C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk. Drawing with fat edges. In Proc. Graph Drawing (GD'01), vol. 2265 of LNCS, pp. 162-177. Springer, 2002.

P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria, 21(A):89-98, 1986.

T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991.

E. R. Gansner and Y. Koren. Improved circular layouts. In Proc. Graph Drawing (GD'06), volume 4372 of LNCS, pp. 386-398. Springer, 2007.

E. R. Gansner and S. C. North. Improved force-directed layouts. In Proc. Graph Drawing (GD'98), volume 1547 of LNCS, pp. 364-373. Springer, 1999.

D. Harel and Y. Koren. Drawing graphs with non-uniform vertices. In Proc. Work. Conf. on Advanced Visual Interfaces (AVI'02), pp. 157-166. ACM Press, 2002.

D. Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Trans. Visual. and Comp. Graphics, 12(5):741-748, 2006.

M. Kaufmann and R. Wiese. Maintaining the mental map for circular drawings. In Proc. Graph Drawing (GD 2000), vol. 2528 of LNCS, pp. 12-22. Springer, 2003.

V. E. Krebs. Visualizing human networks. Release 1.0, pp. 1-25, February 1996.

L. Krempel. Visualisierung komplexer Strukturen. Grundlagen der Darstellung mehrdimensionaler Netzwerke. Campus, 2005.

S. Masuda, T. Kashiwabara, K. Nakajima, and T. Fujisawa. On the NP-completeness of a computer network layout problem. In Proc. 20th IEEE Int. Symposium on Circuits and Systems 1987, pp. 292-295. 1987.

C. Matuszewski, R. Schönfeld, and P. Molitor. Using sifting for k-layer straightline crossing minimization. In Proc. Graph Drawing (GD'99), volume 1731 of LNCS, pp. 217-224. Springer, 2000.

R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. IEEE/ACM Conf. Computer-Aided Design, pp. 42-47. IEEE Society, 1993.

J. M. Six and I. G. Tollis. A framework for user-grouped circular drawings. In Proc. Graph Drawing (GD'03), volume 2912 of LNCS, pp. 135-146. Springer, 2004.

X. Wang and I. Miyamoto. Generating customized layouts. In Proc. Graph Drawing (GD'95), volume 1027 of LNCS, pp. 504-515. Springer, 1996.