Skip to main content
SpringerLink
Log in

Graphviz and Dynagraph — Static and Dynamic Graph Drawing Tools

  • Chapter
Book cover Graph Drawing Software

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

Abstract

Graphviz is a collection of software for viewing and manipulating abstract graphs. It provides graph visualization for tools and web sites in domains such as software engineering, networking, databases, knowledge representation, and bioinformatics. Hundreds of thousands of copies have been distributed under an open source license.

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. Barnson, M. P. (2002) The Bugzilla guide, www.bugzilla.org/docs/html/

    Google Scholar 

  2. Bond, G. W., Cheung, E., Purdy, K. H., Ramming, J. C, Zave, P. (submitted) An open architecture for next-generation telecommunication service. ACM Transactions on Internet Technology

    Google Scholar 

  3. Boutell, T. (2002) GD graphics library, www.boutell.com/gd/

    Google Scholar 

  4. Chen, Y. F., Gansner, E. R., Koutsofios, E. (1998) A C++ data model supporting reachability analysis and dead code detection. IEEE Transactions on Software Engineering 24(9), 682–693

    Article  Google Scholar 

  5. Chen, Y. F., Koutsofios, E. (1997) WebCiao: A website visualization and tracking system

    Google Scholar 

  6. Chvátal, V. (1983) Linear Programming. W. H. Freeman, New York

    MATH  Google Scholar 

  7. (2002) Gnucleus: An Open Source Gnutella Client, www.gnucleus.net

    Google Scholar 

  8. Cohen, J. (1987) Drawing graphs to convey proximity: an incremental arrangement method. ACM Transactions on Computer-Human Interaction 4(11), 197–229

    Google Scholar 

  9. Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., Schrijver, A. (1998) Combinatorial Optimization. John Wiley and Sons

    Google Scholar 

  10. de Icaza, M. (2001) The mono project: An overview, developer.ximian.com/articles/whitepapers/mono/

    Google Scholar 

  11. Eades, P. (1992) Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications 5, 10–36

    MathSciNet  MATH  Google Scholar 

  12. Fortune, S. (1987) A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153–174

    Article  MathSciNet  MATH  Google Scholar 

  13. Freivalds, K., Dogrusoz, U., Kikusts, P. (2002) Disconnected graph layout and the polyomino packing approach. In: P. Mutzel et al. (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 378–391

    Google Scholar 

  14. Fruchterman, T. M. J., Reingold, E. M. (1991) Graph drawing by force-directed placement. Software — Practice and Experience 21(11), 1129–1164

    Article  Google Scholar 

  15. Gansner, E. R. (2002) The DOT language, www.research.att.com/~erg/graphviz/info/lang.html/

    Google Scholar 

  16. Gansner, E. R., Koutsofios, E., North, S. C, Vo, K.-P. (1993) A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19(3), 214–230

    Article  Google Scholar 

  17. Gansner, E. R., North, S. C. (2000) An open graph visualization system and its applications to software engineering. Software — Practice and Experience 30, 1203–1233

    Article  MATH  Google Scholar 

  18. Glassner, A. S. (ed.) (1990) An algorithm for automatically fitting digitized curves. Graphics Gems, Academic Press, 612–626

    Google Scholar 

  19. Harel, D., Koren, Y. (2002) Drawing graphs with non-uniform vertices. In: Proceedings of Advanced Visual Interfaces (AVF02), ACM Press, 157–166

    Google Scholar 

  20. Hershberger, J., Snoeyink, J. (1991) Computing minimum length paths of a given homotopy class. In: Proceedings of the 2nd Workshop Algorithms Data Structure, Lecture Notes in Computer Science 519, Springer-Verlag, 331–342

    Google Scholar 

  21. Holzmann, G. J. (1997) The model checker SPIN. IEEE Transactions on Software Engineering 23(5), 279–295, spinroot.com/spin/whatispin.html/

    Article  MathSciNet  Google Scholar 

  22. Isaksson, B. (2001) DNS Bajaj. www.zonecut.net/dns/

    Google Scholar 

  23. Jenssen, T. K., Laegreid, A., Komorowski, J., Hovig, E. (2001) A literature network of human genes for high-throughput analysis of gene expression. Nature Genetics 28, 21–28, www.pubgene.com

    Google Scholar 

  24. Johnston, P. (2002) Syntacs translation toolkit, inxar.org/syntacs/

    Google Scholar 

  25. Kamada, T., Kawai, S. (1989) An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7–15

    Article  MathSciNet  MATH  Google Scholar 

  26. Koutsofios, E., Dobkin, D. (1991) LEFTY: A two-view editor for technical pictures. In Graphics Interface’ 91, 68–76

    Google Scholar 

  27. Kruskal, J., Seery, J. (1980) Designing network diagrams. In: Proceedings of the First General Conference on Social Graphics, 22–50

    Google Scholar 

  28. Lee, W., Barghouti, N., Mocenigo, J. (1997) Grappa: A graph package in Java. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 336–343

    Google Scholar 

  29. Lyons, K., Meijer, H., Rappaport, D. (1998) Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications 2(1), 1–24

    Article  MathSciNet  Google Scholar 

  30. Marriott, K., Stuckey, P. J., Tarn, V., He, W. (in press) Removing node overlapping in graph layout using constrained optimization. Constraints, 1–31

    Google Scholar 

  31. Misue, K., Eades, P., Lai, W., Sugiyama, K. (1995) Layout adjustment and the mental map. Journal of Visual Languages and Computing 6(2), 183–210

    Article  Google Scholar 

  32. North, S. C, Woodhull, G. (2001) Online hierarchical graph drawing. In: P. Mutzel, M. Jünger, S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer Verlag, 232–246

    Google Scholar 

  33. O’Rourke, J. (1994) Computational Geometry in C. Cambridge University Press, Cambridge

    Google Scholar 

  34. Sammon, Jr., J. W. (1969) A nonlinear mapping for data structure analysis. IEEE Transactions on Computers 18, 401–409

    Article  Google Scholar 

  35. Shepard, R. N. (1962) The analysis of proximities: multidimensional scaling with an unknown distance function. Psychometrika 27, 125–140; 219–246

    Article  MathSciNet  MATH  Google Scholar 

  36. Thain, D. (2000) netmap. www.cs.wisc.edu/~thain/projects/netmap

    Google Scholar 

  37. Torgeson, W. S. (1965) Multidimensional scaling of similarity. Psychometrika 30, 379–393

    Article  Google Scholar 

  38. van Heesch, D. (2002) Doxygen. http://www.stack.nl/~dimitri/doxygen/

    Google Scholar 

  39. Vo, K.-P. (1997) Libcdt: A general and efficient container data type library. In: Proceedings of Summer’ 97 Usenix Conference

    Google Scholar 

  40. Walshaw, C. (2000) A Multilevel Algorithm for Force-Directed Graph Drawing. In: J. Marks (ed.) Graph Drawing’ 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 171–182

    Google Scholar 

  41. Wills, G. (1997) Nicheworks — interactive visualization of very large graphs. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 403–414

    Google Scholar 

  42. Wong, L. (2001) A protein interaction extraction system. In: Pacific Symposium on Biocomputing 6, 520–531

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs — Research, Florham Park, NJ, 07932, USA

    John Ellson, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North & Gordon Woodhull

Authors
  1. John Ellson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emden R. Gansner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eleftherios Koutsofios
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stephen C. North
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gordon Woodhull
    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

Ellson, J., Gansner, E.R., Koutsofios, E., North, S.C., Woodhull, G. (2004). Graphviz and Dynagraph — Static and Dynamic Graph Drawing Tools. 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_6

Download citation

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

  • 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