TopoLayout-DG: A Topological Feature-Based Framework for Visualizing Inside Behavior of Large Directed Graphs

Ragaad AlTarawneh
Computer Graphics and HCI Group, University of Kaiserslautern, Germany

Max Langbein
Computer Graphics and HCI Group, University of Kaiserslautern, Germany

Shah Rukh Humayoun
Computer Graphics and HCI Group, University of Kaiserslautern, Germany

Hans Hagen
Computer Graphics and HCI Group, University of Kaiserslautern, Germany

Ladda ner artikel

Ingår i: Proceedings of SIGRAD 2014, Visual Computing, June 12-13, 2014, Göteborg, Sweden

Linköping Electronic Conference Proceedings 106:12, s. 87-90

Visa mer +

Publicerad: 2014-10-30

ISBN: 978-91-7519-212-3

ISSN: 1650-3686 (tryckt), 1650-3740 (online)


Directed graphs are a useful model of many computational systems including software, hardware, fault trees, and of course the Internet. We present the TopoLayout-DG framework, an extension to the original TopoLayout algorithm, for visualizing the inside behaviour of large directed graphs. The proposed framework consists of: a feature-based multi-level algorithm, called ToF2DG, that detects topological features in large directed graphs in a hierarchical fashion; and visualization methods for the resulting levels of details of the graph’s topological structure. In this work-in-progress paper, we highlight the main steps of the proposed ToF2DG algorithm. Moreover, we show some preliminary visual representations of artificial directed graphs. These preliminary representations indicate that the framework promises to solve some scalability issues in the visualisation of large directed graphs.


Inga nyckelord är tillgängliga


[AMA07] ARCHAMBAULT D., MUNZNER T., AUBER D.: Topolayout: Multilevel graph layout by topological features. IEEE TVCG 13/2 (2007), 305–317. 1, 2, 3

[Ead84] EADES P.: A heuristic for graph drawing. Congressus Numerantium (1984), 149–160. 1, 4

[Ead92] EADES P.: Drawing free trees. Bulletin of the Institute for Combinatorial and its Applications 5(2) (1992), 10–36. 1, 4

[EW94] EADES P., WHITESIDES S.: Drawing graphs in two layers. Theoretical Computer Science 131 (1994), 361–374. 2

[GJ83] GAREY M. R., JOHNSON D. S.: Crossing number is npcomplete. SIAM Journal on Algebraic and Discrete Methods (1983). 2

[Hei11] HEINE C.: Libgraph, November 2011. URL: http://www.informatik.uni-leipzig.de/~hg/libgraph/. 2

[Hol06] HOLTEN D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE TVCG. (2006). 2

[KT13] KORNAROPOULOS E. M., TOLLIS I. G.: DAGView: An approach for visualizing large graphs. In Proceedings of the 20th International Conference on Graph Drawing (Berlin, Heidelberg, 2013), GD’12, Springer-Verlag, pp. 499–510. 2

[Mun97] MUNZNER T.: H3: laying out large directed graphs in 3d hyperbolic space. Proceedings of the IEEE Symposium on Information Visualization (1997). 2

[RS97] ROXBOROUGH T., SEN A.: Graph clustering using multiway ratio cut. Proceedings of Graph Drawing, Lecture Notes on Computer Science 1353 (1997). 2

[STT81] SUGIYAMA K., TAGAWA S., TODA M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions On Systems Man And Cybernetics (1981). 2, 4

[Tar72] TARJAN R. E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2 (1972), 146–160. 3

Citeringar i Crossref