.zotero-ft-cache 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181
  1. close
  2. Skip to main content Skip to sections
  3. This service is more advanced with JavaScript available, learn more at http://activatejavascript.org
  4. SpringerLink
  5. Search
  6. Home
  7. Contact us
  8. Log in
  9. Menu
  10. Home
  11. Contact us
  12. Log in
  13. Graph Drawing
  14. GD 2001 : Graph Drawing pp 31-44 | Cite as
  15. Fast and Simple Horizontal Coordinate Assignment
  16. Authors
  17. Authors and affiliations
  18. Ulrik Brandes
  19. Boris Köpf
  20. Ulrik Brandes
  21. 1
  22. Boris Köpf
  23. 1
  24. 1. Department of Computer & Information Science University of Konstanz Konstanz Germany
  25. Conference paper
  26. First Online: 21 February 2002
  27. 9 Citations
  28. 1.1k Downloads
  29. Part of the Lecture Notes in Computer Science book series (LNCS, volume 2265)
  30. Abstract
  31. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to implement and compares well with existing approaches in terms of assignment quality.
  32. Keywords
  33. Layered Graph Minimum Separation Vertical Alignment Bend Point Graph Drawing
  34. 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.
  35. Download to read the full conference paper text
  36. Cite paper
  37. How to cite?
  38. .RIS Papers Reference Manager RefWorks Zotero
  39. .ENW EndNote
  40. .BIB BibTeX JabRef Mendeley
  41. References
  42. 1.
  43. Oliver Bastert and Christian Matuszewski. Layered drawings of digraphs. In Michael Kaufmann and Dorothea Wagner, editors, Drawing Graphs: Methods and Models , volume 2025 of Lecture Notes in Computer Science , pages 104–139. Springer, 2001. CrossRef Google Scholar
  44. 2.
  45. Christoph Buchheim, Michael Jünger, and Sebastian Leipert. A fast layout algorithm for k -level graphs. Technical Report 99-368, Department of Economics and Computer Science, University of Cologne, 1999. Google Scholar
  46. 3.
  47. Christoph Buchheim, Michael Jünger, and Sebastian Leipert. A fast layout algorithm for k -level graphs. In Joe Marks, editor, Proceedings of the 8th International Symposium on Graph Drawing (GD 2000) , volume 1984 of Lecture Notes in Computer Science , pages 229–240. Springer, 2001. Google Scholar
  48. 4.
  49. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs . Prentice Hall, 1999. Google Scholar
  50. 5.
  51. Peter Eades, Xuemin Lin, and Roberto Tamassia. An algorithm for drawing a hierarchical graph. International Journal of Computational Geometry & Applications , 6:145–156, 1996. MATH CrossRef MathSciNet Google Scholar
  52. 6.
  53. Peter Eades and Kozo Sugiyama. How to draw a directed graph. Journal of Information Processing , 13(4):424–437, 1990. MATH Google Scholar
  54. 7.
  55. Michael Fröhlich and Mattias Werner. The graph visualization system daVinci —a user interface for applications. Technical Report 5/94, Department of Computer Science, University of Bremen, 1994. Google Scholar
  56. 8.
  57. Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, and Kiem-Phong Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering , 19(3):214–230, 1993. CrossRef Google Scholar
  58. 9.
  59. Emden R. Gansner and Stephen C. North. An open graph visualization system and its applications to software engineering. Software—Practice and Experience , 30(11):1203–1233, 2000. MATH CrossRef Google Scholar
  60. 10.
  61. Emden R. Gansner, Stephen C. North, and Kiem-Phong Vo. DAG — A program that draws directed graphs. Software—Practice and Experience , 17(1):1047–1062, 1988. CrossRef Google Scholar
  62. 11.
  63. Lois M. Haibt. A program to draw multilevel flow charts. In Proceedings of the Western Joint Computer Conference , volume 15, pages 131–137, 1959. Google Scholar
  64. 12.
  65. Xuemin Lin and Peter Eades. Area minimization for grid visibility representation of hierarchically planar graphs. In Takao Asano, Hiroshi Imai, Der-Tsai Lee, Shinichi Nakano, and Takeshi Tokuyama, editors, Proceedings of the 5th International Conference on Computing and Combinatorics (COCOON’ 99) , volume 1627 of Lecture Notes in Computer Science , pages 92–102. Springer, 1999. Google Scholar
  66. 13.
  67. Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, and Sebastian Leipert. A library of algorithms for graph drawing. In Sue H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD’ 98) , volume 1547 of Lecture Notes in Computer Science , pages 456–457. Springer, 1998. Google Scholar
  68. 14.
  69. Georg Sander. Graph layout through the VCG tool. In Roberto Tamassia and Ioannis G. Tollis, editors, Proceedings of the DIMACSInternational Workshop on Graph Drawing (GD’ 94) , volume 894 of Lecture Notes in Computer Science , pages 194–205. Springer, 1995. Google Scholar
  70. 15.
  71. Georg Sander. A fast heuristic for hierarchical Manhattan layout. In Franz J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD’ 95) , volume 1027 of Lecture Notes in Computer Science , pages 447–458. Springer, 1996. Google Scholar
  72. 16.
  73. Georg Sander. Graph layout for applications in compiler construction. Theoretical Computer Science , 217(2):175–214, 1999. MATH CrossRef Google Scholar
  74. 17.
  75. Kozo Sugiyama and Kazuo Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics , 21(4):876–892, 1991. CrossRef MathSciNet Google Scholar
  76. 18.
  77. Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics , 11(2):109–125, February 1981. CrossRef MathSciNet Google Scholar
  78. Copyright information
  79. © Springer-Verlag Berlin Heidelberg 2002
  80. About this paper
  81. Cite this paper as:
  82. Brandes U., Köpf B. (2002) Fast and Simple Horizontal Coordinate Assignment. In: Mutzel P., Jünger M., Leipert S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg
  83. DOI https://doi.org/10.1007/3-540-45848-4_3
  84. Publisher Name Springer, Berlin, Heidelberg
  85. Print ISBN 978-3-540-43309-5
  86. Online ISBN 978-3-540-45848-7
  87. eBook Packages Springer Book Archive
  88. Buy this book on publisher's site
  89. Reprints and Permissions
  90. Personalised recommendations
  91. Fast and Simple Horizontal Coordinate Assignment
  92. Cite paper
  93. How to cite?
  94. .RIS Papers Reference Manager RefWorks Zotero
  95. .ENW EndNote
  96. .BIB BibTeX JabRef Mendeley
  97. Actions
  98. Cite paper
  99. How to cite?
  100. .RIS Papers Reference Manager RefWorks Zotero
  101. .ENW EndNote
  102. .BIB BibTeX JabRef Mendeley
  103. Table of contents
  104. Conference paper
  105. Abstract
  106. References
  107. Copyright information
  108. About this paper
  109. Over 10 million scientific documents at your fingertips
  110. Switch Edition
  111. Academic Edition
  112. Corporate Edition
  113. Home
  114. Impressum
  115. Legal information
  116. Privacy statement
  117. How we use cookies
  118. Accessibility
  119. Contact us
  120. Springer Nature
  121. © 2017 Springer International Publishing AG. Part of Springer Nature .
  122. Not logged in Not affiliated 77.20.249.99
  123. Your Privacy
  124. Strictly Necessary Cookies
  125. Performance Cookies
  126. Functional Cookies
  127. Targeting Cookies
  128. More Information
  129. Privacy Preference Centre
  130. Active
  131. Always Active
  132. Save Settings
  133. Allow All
  134. We use cookies to personalise content and ads, to provide social media features and to analyse our traffic. We also share information about your use of our site with our social media, advertising and analytics partners in accordance with our Privacy Statement . You can manage your preferences in Manage Cookies.
  135. Close
  136. OK
  137. Manage Cookies