Advertisement

Theory and Practice of Graph Drawing

  • Tim Dwyer
  • Fabrizio Frati
  • Seok-Hee Hong
  • Karsten Klein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7704)

Abstract

A workshop on Theory and Practice of Graph Drawing was held in conjunction with the \(20^{\text{\tiny th}}\) International Symposium on Graph Drawing to celebrate Peter Eades’s \(60^{\text{\tiny th}}\) birthday. The workshop was hosted by Microsoft Research in Redmond, Washington, USA, on September 18, 2012. This report reviews the contents of the workshop.

Keywords

Cloud Computing Graph Draw Biconnected Graph Steer Committee Member Bipolar Orientation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Three-dimensional graph drawing. Algorithmica 17(2), 199–208 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)Google Scholar
  3. 3.
    Eades, P.: A heuristic for graph drawing. Congr. Numer. 42, 149–160 (1984)MathSciNetGoogle Scholar
  4. 4.
    Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for Clustered Graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 213–226. Springer, Heidelberg (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Tim Dwyer
    • 1
  • Fabrizio Frati
    • 2
  • Seok-Hee Hong
    • 2
  • Karsten Klein
    • 2
  1. 1.Microsoft ResearchRedmondUSA
  2. 2.School of Information TechnologiesThe University of SydneyAustralia

Personalised recommendations