Skip to main content
SpringerLink
Log in

yFiles — Visualization and Automatic Layout of Graphs

  • Chapter
Book cover Graph Drawing Software

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

Abstract

Viewing, editing, optimizing, layouting and animating — these are the general tasks for a software packet for the visualization of graph-like structures.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asano, T., Imai, H., Mukaiyama, A. (1991) Finding a Maximum Weight Independent Set of a Circle Graph. IEICE Transactions E74, 681–683.

    Google Scholar 

  2. Christensen, J., Marks, J., Shieber, S. (1995) An empirical study of algorithm for point-feature label placement, ACM Transactions on Graphics 14(3), 203–232

    Article  Google Scholar 

  3. Di Battista, G., Eades, P., Tamassia, R., Tollis, I. G. (1999) Graph Drawing: Algorithms for the visualization of graphs. Prentice Hall, New Jersey

    MATH  Google Scholar 

  4. Eades P., (1992) Drawing Free Trees, Bulletin of the Institue for Combinatorics and its Applications 5, 10–36

    MathSciNet  MATH  Google Scholar 

  5. Diebold, B., Kaufmann, M. (2001) Usage-based Visualization of Web Localities. In: Proceedings of Information Visualization (invis.au), 159–164

    Google Scholar 

  6. Dogrusöz, U., Madden, B., Madden, P. (1997) Circular Layout in the Graph Layout Toolkit. In: S. North (ed.) Graph Drawing’ 96, Lecture Notes in Computer Science 1190, Springer-Verlag, 92–100

    Google Scholar 

  7. Eiglsperger, M., Fößmeier, U., Kaufmann, M. (2000) Orthogonal graph drawing with constraints. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 3–11

    Google Scholar 

  8. Eiglsperger, M., Kaufmann, M. (2001) Fast Compaction for Orthogonal Drawing with Vertices of prescribed Size. In: P. Mutzel, M. Jünger, S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, 124–138

    Google Scholar 

  9. Eiglsperger, M., Kaufmann, M., Siebenhaller, M. (to appear) Automatic layout for UML class diagrams. SOFTVIS’03.

    Google Scholar 

  10. Fößmeier, U., Kaufmann, M. (1995) Drawing high degree graphs with low bend numbers, In: F.-J. Brandenburg (ed.) Graph Drawing’ 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 254–266

    Google Scholar 

  11. Fößmeier, U. (1997) Orthogonale Visualisierungstechniken für Graphen, Dissertation, University of Tübingen

    Google Scholar 

  12. Prick, A., Ludwig, A., Mehldau, H. (1995) A fast adaptive layout algorithm for undirected graphs. In: R. Tamassia, I. G. Tollis (eds.) Graph Drawing’ 94, Lecture Notes in Computer Science 894, Springer-Verlag, 388–403

    Google Scholar 

  13. Goldschmidt, O., Takvorian, A. (1994) An efficient graph planarization two-phase heuristic. Networks 24, 69–73

    Article  MathSciNet  MATH  Google Scholar 

  14. Himsolt, M. (1997) GML: A portable Graph File Format. Technical Report, University of Passau

    Google Scholar 

  15. Kar, G., Madden, B., Gilbert, R. (1988) Heuristic Layout Algorithms for Network Presentation Services, IEEE Network 11, 29–36

    Article  Google Scholar 

  16. Klau, G. W., Mutzel, P. (1999) Optimal compaction of orthogonal grid draw-ings. In: Integer Programming and Combinatorial Optimization (IPCO’99), Lecture Notes in Computer Science 1610, 304–319

    Google Scholar 

  17. Gajer, P., Kobourov, S. (2002) GRIP: Graph Drawing with Intelligent Placement. Journal of Graph Algorithms and Applications 6(3), Special Issue on GD’ 00, 203–224

    Article  MathSciNet  MATH  Google Scholar 

  18. Krebs, V. (1996) Visualizing Human Networks. Release 1.0: Esther Dyson’s Monthly Report, 1–25

    Google Scholar 

  19. Lengauer, T. (1990) Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner

    Google Scholar 

  20. Resende, M., Ribeiro, C. (1997) A GRASP for graph planarization, Networks 29, 173–189

    Article  MATH  Google Scholar 

  21. Sander, G. (1994) Graph layout through the VCG tool. Technical Report A03/94, Universität des Saarlandes

    Google Scholar 

  22. Six, J. M., Tollis, I. G. (1999) Circular Drawings of Biconnected Graphs. Proc. Alenex’ 99, Lecture Notes in Computer Science 1619, Springer-Verlag, 57–73

    Google Scholar 

  23. Six, J. M., Tollis, I. G. (2000) A Framework for Circular Drawings of Networks. In: J. Kratochvil (ed.) Graph Drawing’ 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 107–116

    Google Scholar 

  24. Six, J.M. (2000) VisTool: A Tool for Visualizating Graphs. Ph.D. Thesis, University of Texas at Dallas

    Google Scholar 

  25. šïrava, M., et al. (2002) BioMiner — Modeling, Analyzing, and Visualizing Bio-chemical Pathways and Networks. In: Proceedings of ECCB, Bioinformatics 19(10)

    Google Scholar 

  26. Tamassia, R. (1987) On Embedding a Graph in the Grid with the Minimum Number of Bends. SIAM Jounal on Computing 16(3), 421–444

    Article  MathSciNet  MATH  Google Scholar 

  27. http://www.yworks.com/products/yed

    Google Scholar 

  28. http://www-pr.informatik.uni-tuebingen.de/research/uml/j arinspector.xml

    Google Scholar 

  29. http://www-pr.informatik.unistuebingen.de/research/yweb

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. yWorks GmbH, Sand 13, 72076, Tübingen, Germany

    Roland Wiese

  2. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 72026, Tübingen, Germany

    Markus Eiglsperger & Michael Kaufmann

Authors
  1. Roland Wiese
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Eiglsperger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstraße 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Computergraphik und Algorithmen, Technische Universität Wien, Favoritenstraße 9-11 E186, 1040, Wien, Austria

    Petra Mutzel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wiese, R., Eiglsperger, M., Kaufmann, M. (2004). yFiles — Visualization and Automatic Layout of Graphs. In: Jünger, M., Mutzel, P. (eds) Graph Drawing Software. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18638-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18638-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62214-4

  • Online ISBN: 978-3-642-18638-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation