Skip to main content
Springer Nature Link
Log in

Sugiyama Algorithm

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 474 Accesses

Years and Authors of Summarized Original Work

  • 1981; Sugiyama, Tagawa, Toda

Sugiyama Algorithm, Fig. 1
figure 1953 figure 1953

Illustration of the steps of the Sugiyama framework

Full size image

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bastert O, Matuszewski C (2000) Layered drawings of digraphs. In: Kaufman M, Wagner D (eds) Drawing graphs: method and models. Lecture notes in computer science, vol 2025. Springer, Berlin/Heidelberg, pp 87–120

    Chapter  Google Scholar 

  2. Brandes U, Köpf B (2002) Fast and simple horizontal coordinate assignment. In: Mutzel P, Jünger M, Leipert S (eds) Graph drawing. Lecture notes in computer science, vol 2265. Springer, Berlin/Heidelberg, pp 31–44

    Chapter  Google Scholar 

  3. Coffman EG Jr, Graham R (1972) Optimal scheduling for two-processor systems. Acta Inform 1(3):200–213

    Article  MathSciNet  MATH  Google Scholar 

  4. Eades P, Sugiyama K (1990) How to draw a directed graph. J Inf Process 13(4):424–437

    MATH  Google Scholar 

  5. Eades P, Wormald NC (1994) Edge crossings in drawings of bipartite graphs. Algorithmica 11(4):379–403

    Article  MathSciNet  MATH  Google Scholar 

  6. Eades P, Lin X, Tamassia R (1996) An algorithm for drawing a hierarchical graph. Int J Comput Geom Appl 6(2):145–156

    Article  MathSciNet  MATH  Google Scholar 

  7. Eppstein D, Goodrich MT, Meng JY (2007) Confluent layered drawings. Algorithmica 47(4):439–452

    Article  MathSciNet  MATH  Google Scholar 

  8. Fu X, Hong SH, Nikolov N, Shen X, Wu Y, Xu K (2007) Visualization and analysis of email networks. In: Asia-Pacific symposium on visualization, Sydney, pp 1–8

    Google Scholar 

  9. Gansner ER, Koutsofios E, North SC, Vo KP (1993) A technique for drawing directed graphs. IEEE Trans Softw Eng 19(3):214–230

    Article  Google Scholar 

  10. Healy P, Nikolov NS (2002) How to layer a directed acyclic graph. In: Mutzel P, Jünger M, Leipert S (eds) Graph drawing. Lecture notes in computer science, vol 2265. Springer, Berlin/Heidelberg, pp 16–30

    Chapter  Google Scholar 

  11. Healy P, Nikolov NS (2013) Hierarchical drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization. Discrete mathematics and its applications, chap 13. Chapman and Hall/CRC, Boca Raton/London/New York, pp 409–454

    Google Scholar 

  12. Lempel A, Cederbaum I (1966) Minimum feedback arc and vertex sets of a directed graph. IEEE Trans Circuit Theory 13(4):399–403

    Article  MathSciNet  MATH  Google Scholar 

  13. Mehlhorn K (1984) Data structures and algorithms, Volume 2: graph algorithms and NP-completeness. Springer, Heidelberg

    MATH  Google Scholar 

  14. Newbery FJ (1989) Edge concentration: a method for clustering directed graphs. In: Proceedings of the 2nd international workshop on software configuration management (SCM ’89), Princeton. ACM, pp 76– 85

    Chapter  Google Scholar 

  15. Nikolov NS, Tarassov A, Branke J (2005) In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. J Exp Algorithmics 10:1–27

    Article  MathSciNet  MATH  Google Scholar 

  16. Pupyrev S, Nachmanson L, Kaufmann M (2011) Improving layered graph layouts with edge bundling. In: Brandes U, Cornelsen S (eds) Graph drawing. Lecture notes in computer science, vol 6502. Springer, Berlin/Heidelberg, pp 329–340

    Chapter  Google Scholar 

  17. Sander G (1996) A fast heuristic for hierarchical Manhattan layout. In: Brandenburg FJ (ed) Graph drawing. Lecture notes in computer science, vol 1027. Springer, Berlin/Heidelberg, pp 447–458

    Chapter  Google Scholar 

  18. Schwikowski B, Uetz P, Fields S (2000) A network of protein-protein interactions in yeast. Nat Biotechnol 18(12):1257–1261

    Article  Google Scholar 

  19. Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical system structures. IEEE Trans Syst Man Cybern 11(2):109–125

    Article  MathSciNet  Google Scholar 

  20. Warfield JN (1977) Crossing theory and hierarchical mapping. IEEE Trans Syst Man Cybern 7(7):502–523

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Systems, University of Limerick, Limerick, Republic of Ireland

    Nikola S. Nikolov

Authors
  1. Nikola S. Nikolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nikola S. Nikolov .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Nikolov, N.S. (2016). Sugiyama Algorithm. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_649

Download citation

Publish with us

Policies and ethics