Numerical optimization-based graph drawing revisited

IEEE Pacific Visualization Symposium 2012, PacificVis 2012 - Proceedings

Volumn , Issue , 2012, Pages 81-88

  Hosobe, Hiroshi ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FORCE MODEL; FORCE-DIRECTED; GRAPH DRAWING; L-BFGS METHOD; NUMERICAL OPTIMIZATIONS; UNDIRECTED GRAPH;

DRAWING (GRAPHICS); OPTIMIZATION; VISUALIZATION;

NUMERICAL METHODS;

EID: 84860690260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PacificVis.2012.6183577     Document Type: Conference Paper

References (30)

1. G. Andrew and J. Gao. Scalable training of L1-regularized log-linear models. In Proc. ICML, pages 33-40, 2007.
2. G. Bartel, C. Gutwenger, K. Klein, and P. Mutzel. An experimental evaluation of multilevel layout methods. In Proc. GD, volume 6502 of LNCS, pages 80-91, 2010.
3. U. Brandes and C. Pich. Eigensolver methods for progressive multidimensional scaling of large data. In Proc. GD, volume 4372 of LNCS, pages 42-53, 2007.
4. U. Brandes and C. Pich. An experimental study on distance-based graph drawing. In Proc. GD, volume 5417 of LNCS, pages 218-229, 2009.
5. A. Civril, M. Magdon-Ismail, and E. Bocek-Rivele. SDE: Graph drawing using spectral distance embedding. In Proc. GD, volume 3843 of LNCS, pages 512-513, 2005.
6. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Trans. Gr., 15(4):301-331, 1996.
7. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
8. T. Dwyer and K. Marriott. Constrained stress majorization using diagonally scaled gradient projection. In Proc. GD, volume 4875 of LNCS, pages 219-230, 2007.
9. T. Dwyer, K. Marriott, and M. Wybrow. Topology preserving constrained graph layout. In Proc. GD, volume 5417 of LNCS, pages 230-241, 2009.
10. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
11. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by forcedirected placement. Softw. Pract. Exper., 21(11):1129-1164, 1991.
12. E. R. Gansner, Y. Koren, and S. C. North. Graph drawing by stress majorization. In Proc. GD, volume 3383 of LNCS, pages 239-250, 2004.
13. S. Hachul and M. J̈unger. Drawing large graphs with a potential-fieldbased multilevel algorithm. In Proc. GD, volume 3383 of LNCS, pages 285-295, 2004.
14. S. Hachul and M. J̈unger. Large-graph layout algorithms at work: An experimental study. J. Graph Algorithms Appl., 11(2):345-369, 2007.
15. D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. In Proc. GD, volume 2528 of LNCS, pages 207-219, 2002.
16. H. Hosobe. A modular geometric constraint solver for user interface applications. In Proc. ACM UIST, pages 91-100, 2001.
17. H. Hosobe. A high-dimensional approach to interactive graph visualization. In Proc. ACM SAC, pages 1253-1257, 2004.
18. H. Hosobe. An interactive large graph visualizer. In Proc. Smart Graphics, volume 5166 of LNCS, pages 271-272, 2008.
19. Y. Hu. Efficient, high-quality force-directed graph drawing. Mathematica J., 10(1):37-71, 2005.
20. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inf. Process. Lett., 31(1):7-15, 1989.
21. Y. Koren, L. Carmel, and D. Harel. ACE: A fast multiscale eigenvectors computation for drawing huge graphs. In Proc. IEEE InfoVis, pages 137-144, 2002.
22. T. Matsubayashi and T. Yamada. A force-directed graph drawing based on the hierarchical individual timestep method. Intl. J. Elect. Comput. Eng., 2(10):686-691, 2007.
23. A. Noack. Energy-based clustering of graphs with nonuniform degrees. In Proc. GD, volume 3843 of LNCS, pages 309-320, 2006.
24. J. Nocedal. Updating quasi-newton matrices with limited storage. Math. Comput., 35(151):773-782, 1980.
25. J. Nocedal and S. J. Wright. Numerical Optimization. Springer, 2nd edition, 2006.
26. M. N̈ollenburg and A.Wolff. Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Visual. Comput. Gr., 17(5):626-641, 2011.
27. A. J. Quigley and P. Eades. FADE: Graph drawing, clustering, and visual abstraction. In Proc. GD, volume 1984 of LNCS, pages 197-210, 2000.
28. D. Tunkelang. JIGGLE: Java interactive graph layout environment. In Proc. GD, volume 1547 of LNCS, pages 412-422, 1998.
29. D. Tunkelang. A numerical optimization approach to general graph drawing (Ph.D. thesis). Tech. Rep. CMU-CS-98-189, Sch. Comput. Sci., Carnegie Mellon Univ., 1999.
30. C.Walshaw. A multilevel algorithm for force-directed graph-drawing. J. Graph Algorithms Appl., 7(3):253-285, 2003.