On the Visualization and Aesthetics of Large Graphs

Short Abstract
  • David Harel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2890)


The talk will survey 14 years of our group’s work on graph drawing. It will start with a simulated annealing algorithm we developed in 1989, that works well for graphs with 20–40 nodes, but has severe problems for larger graphs. It will culminate with extremely powerful multi-scale and algebraic approaches developed in the last few years that produce beautiful renditions of million-node graphs in very reasonable time. The work was done with Ron Davidson, Gregory Yashchin, Ronny Hadany, Liran Carmel and Yehuda Koren.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • David Harel
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceThe Weizmann Institute of Science 

Personalised recommendations