article

One-dimensional layout optimization, with applications to graph drawing by axis separation

Authors:

David HarelAuthors Info & Claims

Computational Geometry: Theory and Applications, Volume 32, Issue 2

Pages 115 - 138

Published: 01 October 2005 Publication History

Abstract

In this paper we discuss a useful family of graph drawing algorithms, characterized by their ability to draw graphs in one dimension. We define the special requirements from such algorithms and show how several graph drawing techniques can be extended to handle this task. In particular, we suggest a novel optimization algorithm that facilitates using the Kamada and Kawai model [Inform. Process. Lett. 31 (1989) 7-15] for producing one-dimensional layouts. The most important application of the algorithms seems to be in achieving graph drawing by axis separation, where each axis of the drawing addresses different aspects of aesthetics.

References

[1]

B. Beckman, Theory of spectral graph layout, Technical Report MSR-TR-94-04, Microsoft Research, 1994

[2]

Brandes, U. and Cornelsen, S., Visual ranking of link structures. J. Graph Algorithms Appl. v7. 181-201.

[3]

Bruss, I. and Frick, A., Fast interactive 3-D graph visualization. In: Lecture Notes Comput. Sci., vol. 1027. Springer, Berlin. pp. 99-110.

Digital Library

[4]

Carmel, L., Harel, D. and Koren, Y., Combining hierarchy and energy for drawing directed graphs. IEEE Trans. Vis. Comput. Graph. v10. 46-57.

Digital Library

[5]

Carmel, L., Koren, Y. and Harel, D., Visualizing and classifying odors using a similarity matrix. In: Proc. 9th International Symposium on Olfaction and Electronic Nose (ISOEN'02), Aracne, pp. 141-146.

[6]

Cohen, J.D., Drawing graphs to convey proximity: an incremental arrangement method. ACM Trans. Computer-Human Interact. v4. 197-229.

Digital Library

[7]

Diaz, J., Petit, J. and Serna, M., A survey on graph layout problems. ACM Comput. Surv. v34. 313-356.

Digital Library

[8]

Di Battista, G., Eades, P., Tamassia, R. and Tollis, I.G., Graph Drawing: Algorithms for the Visualization of Graphs. 1999. Prentice-Hall, Englewood Cliffs, NJ.

Digital Library

[9]

Eades, P., A heuristic for graph drawing. Congressus Numerantium. v42. 149-160.

[10]

Everitt, B.S. and Dunn, G., Applied Multivariate Data Analysis. 1991. Arnold.

[11]

Fruchterman, T.M.G. and Reingold, E., Graph drawing by force-directed placement. Software-Practice Exp. v21. 1129-1164.

Digital Library

[12]

Gajer, P., Goodrich, M.T. and Kobourov, S.G., A multi-dimensional approach to force-directed layouts of large graphs. In: Lecture Notes Comput. Sci., vol. 1984. Springer, Berlin. pp. 211-221.

Digital Library

[13]

Golub, G.H. and Van Loan, C.F., Matrix Computations. 1996. Johns Hopkins University Press.

[14]

Hall, K.M., An r-dimensional quadratic placement algorithm. Management Sci. v17. 219-229.

[15]

Harel, D. and Koren, Y., Graph drawing by high-dimensional embedding. In: Lecture Notes Comput. Sci., vol. 2528. Springer, Berlin. pp. 207-219.

Digital Library

[16]

Juvan, M. and Mohar, B., Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math. v36. 153-168.

Digital Library

[17]

Kamada, T. and Kawai, S., An algorithm for drawing general undirected graphs. Inform. Process. Lett. v31. 7-15.

Digital Library

[18]

In: Kaufmann, M., Wagner, D. (Eds.), Lecture Notes Comput. Sci., vol. 2025. Springer, Berlin.

[19]

Koren, Y., Carmel, L. and Harel, D., Drawing huge graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation. v1. 645-673.

[20]

Koren, Y. and Harel, D., A multi-scale algorithm for the linear arrangement problem. In: Lecture Notes Comput. Sci., vol. 2573. Springer, Berlin. pp. 293-306.

Digital Library

[21]

Koren, Y. and Harel, D., A two-way visualization method for clustered data. In: Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'03), ACM Press, New York. pp. 589-594.

Digital Library

[22]

Koren, Y. and Harel, D., Axis-by-axis stress minimization. In: Proc. 11th Inter. Symposium on Graph Drawing (GD'03), Springer, Berlin. pp. 450-459.

[23]

Koren, Y., Graph drawing by subspace optimization. In: Proc. 6th Eurographics---IEEE TCVG Symposia on Visualization (VisSym'04), Eurographics. pp. 65-74.

Digital Library

[24]

Kruskal, J. and Seery, J., Designing network diagrams. In: Proc. First General Conference on Social Graphics, US Department of the Census. pp. 22-50.

[25]

Lehoucq, B., Sorensen, D.C. and Yang, C., ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. 1998. SIAM.

[26]

A.J. McAllister, A new heuristic algorithm for the linear arrangement problem, Technical Report 99_126a, Faculty of Computer Science, University of New Brunswick, 1999

[27]

Mohar, B., The Laplacian spectrum of graphs. Graph Theory Combin. Appl. v2. 871-898.

[28]

Sugiyama, K., Tagawa, S. and Toda, M., Methods for visual understanding of hierarchical systems. IEEE Trans. Systems Man Cybernet. v11. 109-125.

[29]

Sammon, J.W., A nonlinear mapping for data structure analysis. IEEE Trans. Comput. v18. 401-409.

Digital Library

[30]

D. Tunkelang, A numerical optimization approach to general graph drawing, Ph.D. Thesis, Carnegie Mellon University, 1999

[31]

Walshaw, C., A multilevel algorithm for force-directed graph drawing. J. Graph Algorithms Appl. v7. 253-285.

[32]

http://math.nist.gov/MatrixMarket

[33]

http://www.gre.ac.uk/~c.walshaw/partition

Cited By

Brandes UPich C(2006)Eigensolver methods for progressive multidimensional scaling of large dataProceedings of the 14th international conference on Graph drawing10.5555/1758612.1758620(42-53)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.5555/1758612.1758620
Çivril AMagdon-Ismail MBocek-Rivele E(2006)SSDEProceedings of the 14th international conference on Graph drawing10.5555/1758612.1758619(30-41)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.5555/1758612.1758619
Dwyer TKoren YMarriott K(2006)Drawing Directed Graphs Using Quadratic ProgrammingIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2006.6712:4(536-548)Online publication date: 1-Jul-2006
https://dl.acm.org/doi/10.1109/TVCG.2006.67
Show More Cited By

Index Terms

One-dimensional layout optimization, with applications to graph drawing by axis separation

Recommendations

Queue Layout of Bipartite Graph Subdivisions

For an integer d > 0, a d-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into d sets of non-nested edges with respect to the vertex ordering. Recently V. Dujmović and D. R. Wood showed that for every ...
On the Complexity of Lombardi Graph Drawing
Graph Drawing and Network Visualization
Abstract
In a Lombardi drawing of a graph the vertices are drawn as points and the edges are drawn as circular arcs connecting their respective endpoints. Additionally, all vertices have perfect angular resolution, i.e., all angles incident to a vertex v ...
(d+1,2) -Track Layout of Bipartite Graph Subdivisions

A ( k ,2- track layout of a graph G consists of a 2- track assignment of G and an edge k -coloring of G with no monochromatic X-crossing . This paper studies the problem of ( k ,2)-track layout of bipartite graph subdivisions. Recently V.Dujmović and ...

Comments

Information & Contributors

Information

Published In

cover image Computational Geometry: Theory and Applications

Computational Geometry: Theory and Applications Volume 32, Issue 2

October 2005

103 pages

ISSN:0925-7721

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2005.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 October 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Brandes UPich C(2006)Eigensolver methods for progressive multidimensional scaling of large dataProceedings of the 14th international conference on Graph drawing10.5555/1758612.1758620(42-53)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.5555/1758612.1758620
Çivril AMagdon-Ismail MBocek-Rivele E(2006)SSDEProceedings of the 14th international conference on Graph drawing10.5555/1758612.1758619(30-41)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.5555/1758612.1758619
Dwyer TKoren YMarriott K(2006)Drawing Directed Graphs Using Quadratic ProgrammingIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2006.6712:4(536-548)Online publication date: 1-Jul-2006
https://dl.acm.org/doi/10.1109/TVCG.2006.67
Henry NFekete J(2006)MatrixExplorerIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2006.16012:5(677-684)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1109/TVCG.2006.160

View Options

View options

Get Access

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

Media

Figures

Other

Tables

View Issue’s Table of Contents