research-article

An improved decomposition and drawing process for optimal topological visualization of directed graphs

Authors:

Ala Abuthawabeh,

Dirk ZeckzerAuthors Info & Claims

SCCG '15: Proceedings of the 31st Spring Conference on Computer Graphics

Pages 89 - 96

https://doi.org/10.1145/2788539.2788551

Published: 22 April 2015 Publication History

Abstract

Important information in application areas like Bio-Informatics, Biology, and Software Engineering is encoded in directed graphs. Typically, these graphs are represented using node-link diagrams. In these areas differentiating between cyclic and acyclic subgraphs shows important information about the structure and eases the analysis of these graphs. However, existing approaches are uniform and do not differentiate between different structures while computing the layout of the directed graph. We propose a topology-based approach that decomposes directed graphs into subgraphs for different topological structures, builds a two-level hierarchy of coarse grained graphs, and applies optimized area-aware layout algorithms to draw them. We applied our approach to one synthetic data set for illustration purposes and to one real data set showing usage dependencies in a software system. The results show that the different structural components of the directed graphs can be clearly identified.

References

[1]

AlTarawneh, R., Langbein, M., Humayoun, S. R., and Hagen, H. 2014. TopoLayout-DG: A Topological Feature-Based Framework for Visualizing Inside Behavior of Large Directed Graphs. In Proceedings of SIGRAD 2014, Visual Computing, June 12-13, 2014, Göteborg, Sweden, 87--90.

[2]

Archambault, D., Munzner, T., and Auber, D. 2007. TopoLayout: Multilevel Graph Layout by Topological Features. IEEE Transactions on Visualization and Computer Graphics 13, 2, 305--317.

Digital Library

[3]

Archambault, D., Munzner, T., and Auber, D. 2008. GrouseFlocks: Steerable Exploration of Graph Hierarchy Space. IEEE Transactions on Visualization and Computer Graphics 14, 4, 900--913.

Digital Library

[4]

Archambault, D., Munzner, T., and Auber, D. 2011. Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths. IEEE Transactions on Visualization and Computer Graphics 17, 3, 276--289.

Digital Library

[5]

Bachmaier, C., Brandenburg, F. J., Brunner, W., and Fülö P, R. 2009. Coordinate assignment for cyclic level graphs. In Computing and combinatorics. Springer, 66--75.

Digital Library

[6]

Bachmaier, C., Brandenburg, F., Brunner, W., and Lovsz, G. 2009. Cyclic Leveling of Directed Graphs. In Graph Drawing, vol. 5417 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 348--359.

Digital Library

[7]

Bachmaier, C., Brandenburg, F.-J., Brunner, W., and Fülö P, R. 2012. Drawing Recurrent Hierarchies. J. Graph Algorithms Appl. 16, 2, 151--198.

[8]

Barak Naveh, 2013. JGraphT. http://www.jgrapht.org; Online; accessed 26-September-2014.

[9]

Batagelj, V., Brandenburg, F., Didimo, W., Liotta, G., Palladino, P., and Patrignani, M. 2011. Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. IEEE Transactions on Visualization and Computer Graphics 17, 11, 1587--1598.

Digital Library

[10]

Beck, F., and Diehl, S. 2011. On the congruence of modularity and code coupling. In SIGSOFT/FSE '11 and ESEC '11: Proceedings of the 19th ACM SIGSOFT Symposium on the Foundations of Software Engineering and 13rd European Software Engineering Conference, ACM, 354--364.

Digital Library

[11]

Becker, M., and Rojas, I. 2001. A Graph Layout Algorithm for Drawing Metabolic Pathways. Bioinformatics 17, 461--467.

[12]

Bourqui, R., Cottret, L., Lacroix, V., Auber, D., Mary, P., Sagot, M.-F., and Jourdan, F. 2007. Metabolic network visualization eliminating node redundance and preserving metabolic pathways. BMC systems biology 1, 1, 29.

[13]

Bourqui, R., Simonetto, P., and Jourdan, F. 2010. A Stable Decomposition Algorithm for Dynamic Social Network Analysis. In Advances in Knowledge Discovery and Management, F. Guillet, G. Ritschard, D. Zighed, and H. Briand, Eds., vol. 292 of Studies in Computational Intelligence. Springer Berlin Heidelberg, 167--178.

[14]

Brandes, U., and Köpf, B. 2002. Fast and Simple Horizontal Coordinate Assignment. In Graph Drawing, P. Mutzel, M. Jünger, and S. Leipert, Eds., vol. 2265 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 31--44.

Digital Library

[15]

Buchheim, C., Jünger, M., and Leipert, S. 2002. Improving Walker's Algorithm to Run in Linear Time. In Graph Drawing, M. Goodrich and S. Kobourov, Eds., vol. 2528 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 344--353.

Digital Library

[16]

Dit Gabouje, S. S., and Zimányi, E. 2007. A New Constraint-Based Compound Graph Layout Algorithm for Drawing Biochemical Networks. In Visual Languages for Interactive Computing: Definitions and Formalizations, F. Ferri, Ed. IGI Global, ch. 19, 407--424.

[17]

Elmqvist, N., Do, T., Goodell, H., Henry, N., and Fekete, J. 2008. ZAME: Interactive Large-Scale Graph Visualization. In IEEE VGTC Pacific Visualization Symposium 2008 (PacificVis 2008), 215--222.

[18]

Johnson, D. 1975. Finding All the Elementary Circuits of a Directed Graph. SIAM Journal on Computing 4, 1, 77--84.

[19]

Karp, P. D., and Paley, S. 1994. Automated Drawing of Metabolic Pathways. In Third International Conference on Bioinformatics and Genome Research, H. Lim, C. Cantor, and R. Robbins, Eds., 225--238.

[20]

Karp, P. D., Lowrance, J. D., Strat, T. M., and Wilkins, D. E. 1994. The Grasper-CL graph management system. LISP and Symbolic Computation 7, 4, 251--290.

Digital Library

[21]

Lambert, A., Dubois, J., and Bourqui, R. 2011. Pathway preserving representation of metabolic networks. Computer Graphics Forum 30, 3, 1021--1030.

Digital Library

[22]

Laval, J., Falleri, J.-R., Vismara, P., and Ducasse, S. 2012. Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems. Journal of Object Technology 11, 1, 1--24.

[23]

Rohrschneider, M., Heine, C., Reichenbach, A., Kerren, A., and Scheuermann, G. 2010. A novel grid-based visualization approach for metabolic networks with advanced focus& context view. In Graph Drawing. Springer Berlin Heidelberg, 268--279.

Digital Library

[24]

Schreiber, F. 2003. Visual comparison of metabolic pathways. Journal of Visual Languages and Computing 14, 4, 327--340.

[25]

Sugiyama, K., Tagawa, S., and Toda, M. 1981. Methods for Visual Understanding of Hierarchical System Structures. IEEE Transactions on Systems, Man and Cybernetics 11, 2 (Feb), 109--125.

[26]

Szwarcfiter, J. L., and Lauer, P. E. 1974. Finding the elementary cycles of a directed graph in O(n+m) per cycle. Tech. Rep. 060, University of Newcastle upon Tyne (GB).

[27]

Tamassia, R., Ed. 2007. Handbook of Graph Drawing and Visualization. Discrete Mathematics and Its Applications. Chapman & Hall/CRC.

Digital Library

[28]

Tarjan, R. 1973. Enumeration of the Elementary Circuits of a Directed Graph. SIAM Journal on Computing 2, 3, 211--216.

[29]

Tiernan, J. C. 1970. An Efficient Search Algorithm to Find the Elementary Circuits of a Graph. Commun. ACM 13, 12 (Dec.), 722--726.

Digital Library

[30]

Wegner, K., and Kummer, U. 2005. A new dynamical layout algorithm for complex biochemical reaction networks. BMC Bioinformatics 6, 1, 1--12.

Cited By

Abuthawabeh AZeckzer D(2015)SMNLV: A small-multiples node-link visualization supporting software comprehension by displaying multiple relationships in software structure2015 IEEE 3rd Working Conference on Software Visualization (VISSOFT)10.1109/VISSOFT.2015.7332432(175-179)Online publication date: Sep-2015
https://doi.org/10.1109/VISSOFT.2015.7332432

Index Terms

An improved decomposition and drawing process for optimal topological visualization of directed graphs
1. Applied computing
  1. Document management and text processing
    1. Document capture
      1. Graphics recognition and interpretation
2. Computing methodologies
  1. Computer graphics

Recommendations

Spanning trees in dense directed graphs
Abstract
In 2001, Komlós, Sárközy and Szemerédi proved that, for each α > 0, there is some c > 0 and n 0 such that, if n ≥ n 0, then every n-vertex graph with minimum degree at least ( 1 / 2 + α ) n contains a copy of every n-vertex tree with ...
Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time

In this paper, we design an algorithm that, given a directed graph G and the Cartesian-product decomposition of its underlying undirected graph G , produces the directed Cartesian-product decomposition of G in linear time. This is the first time that ...
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
Abstract
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. This paper discusses symmetric drawings of oneconnected planar graphs. More specifically, we discuss planar (geometric) automorphisms, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

SCCG '15: Proceedings of the 31st Spring Conference on Computer Graphics

April 2015

152 pages

ISBN:9781450336932

DOI:10.1145/2788539

Conference Chair:
Joaquim Jorge
Universidade de Lisboa, Portugal
,
Program Chairs:
Luís Paulo Santos
Universidade do Minho, Portugal
,
Roman Ďurikovič
Comenius University, Slovakia

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 April 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SCCG'15

SCCG'15: Spring Conference on Computer Graphics

April 22 - 24, 2015

Smolenice, Slovakia

Acceptance Rates

Overall Acceptance Rate 67 of 115 submissions, 58%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
77
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Abuthawabeh AZeckzer D(2015)SMNLV: A small-multiples node-link visualization supporting software comprehension by displaying multiple relationships in software structure2015 IEEE 3rd Working Conference on Software Visualization (VISSOFT)10.1109/VISSOFT.2015.7332432(175-179)Online publication date: Sep-2015
https://doi.org/10.1109/VISSOFT.2015.7332432

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten