{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:46:01Z","timestamp":1780994761427,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642622144","type":"print"},{"value":"9783642186387","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-642-18638-7_6","type":"book-chapter","created":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T02:57:24Z","timestamp":1303527444000},"page":"127-148","source":"Crossref","is-referenced-by-count":170,"title":["Graphviz and Dynagraph \u2014 Static and Dynamic Graph Drawing Tools"],"prefix":"10.1007","author":[{"given":"John","family":"Ellson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emden R.","family":"Gansner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eleftherios","family":"Koutsofios","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen C.","family":"North","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gordon","family":"Woodhull","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Barnson, M. P. (2002) The Bugzilla guide, www.bugzilla.org\/docs\/html\/"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/967030.967034"},{"key":"6_CR3","unstructured":"Boutell, T. (2002) GD graphics library, www.boutell.com\/gd\/"},{"issue":"9","key":"6_CR4","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/32.713323","volume":"24","author":"YF Chen","year":"1998","unstructured":"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\u2013693","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR5","unstructured":"Chen, Y. F., Koutsofios, E. (1997) WebCiao: A website visualization and tracking system"},{"key":"6_CR6","volume-title":"Linear Programming","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V. (1983) Linear Programming. W. H. Freeman, New York"},{"key":"6_CR7","unstructured":"(2002) Gnucleus: An Open Source Gnutella Client, www.gnucleus.net"},{"issue":"11","key":"6_CR8","first-page":"197","volume":"4","author":"J Cohen","year":"1987","unstructured":"Cohen, J. (1987) Drawing graphs to convey proximity: an incremental arrangement method. ACM Transactions on Computer-Human Interaction 4(11), 197\u2013229","journal-title":"ACM Transactions on Computer-Human Interaction"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., Schrijver, A. (1998) Combinatorial Optimization. John Wiley and Sons","DOI":"10.1002\/9781118033142"},{"key":"6_CR10","unstructured":"de Icaza, M. (2001) The mono project: An overview, developer.ximian.com\/articles\/whitepapers\/mono\/"},{"key":"6_CR11","first-page":"10","volume":"5","author":"P Eades","year":"1992","unstructured":"Eades, P. (1992) Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications 5, 10\u201336","journal-title":"Bulletin of the Institute for Combinatorics and its Applications"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S Fortune","year":"1987","unstructured":"Fortune, S. (1987) A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153\u2013174","journal-title":"Algorithmica"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Freivalds, K., Dogrusoz, U., Kikusts, P. (2002) Disconnected graph layout and the polyomino packing approach. In: P. Mutzel et al. (eds.) Graph Drawing\u2019 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 378\u2013391","DOI":"10.1007\/3-540-45848-4_30"},{"issue":"11","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T. M. J., Reingold, E. M. (1991) Graph drawing by force-directed placement. Software \u2014 Practice and Experience 21(11), 1129\u20131164","journal-title":"Software \u2014 Practice and Experience"},{"key":"6_CR15","unstructured":"Gansner, E. R. (2002) The DOT language, www.research.att.com\/~erg\/graphviz\/info\/lang.html\/"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"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\u2013230","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","volume":"30","author":"ER Gansner","year":"2000","unstructured":"Gansner, E. R., North, S. C. (2000) An open graph visualization system and its applications to software engineering. Software \u2014 Practice and Experience 30, 1203\u20131233","journal-title":"Software \u2014 Practice and Experience"},{"key":"6_CR18","unstructured":"Glassner, A. S. (ed.) (1990) An algorithm for automatically fitting digitized curves. Graphics Gems, Academic Press, 612\u2013626"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Harel, D., Koren, Y. (2002) Drawing graphs with non-uniform vertices. In: Proceedings of Advanced Visual Interfaces (AVF02), ACM Press, 157\u2013166","DOI":"10.1145\/1556262.1556288"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013342","DOI":"10.1007\/BFb0028273"},{"issue":"5","key":"6_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"GJ Holzmann","year":"1997","unstructured":"Holzmann, G. J. (1997) The model checker SPIN. IEEE Transactions on Software Engineering 23(5), 279\u2013295, spinroot.com\/spin\/whatispin.html\/","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR22","unstructured":"Isaksson, B. (2001) DNS Bajaj. www.zonecut.net\/dns\/"},{"key":"6_CR23","first-page":"21","volume":"28","author":"TK Jenssen","year":"2001","unstructured":"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\u201328, www.pubgene.com","journal-title":"Nature Genetics"},{"key":"6_CR24","unstructured":"Johnston, P. (2002) Syntacs translation toolkit, inxar.org\/syntacs\/"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S. (1989) An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7\u201315","journal-title":"Information Processing Letters"},{"key":"6_CR26","unstructured":"Koutsofios, E., Dobkin, D. (1991) LEFTY: A two-view editor for technical pictures. In Graphics Interface\u2019 91, 68\u201376"},{"key":"6_CR27","unstructured":"Kruskal, J., Seery, J. (1980) Designing network diagrams. In: Proceedings of the First General Conference on Social Graphics, 22\u201350"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Lee, W., Barghouti, N., Mocenigo, J. (1997) Grappa: A graph package in Java. In: G. Di Battista (ed.) Graph Drawing\u2019 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 336\u2013343","DOI":"10.1007\/3-540-63938-1_78"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00004","volume":"2","author":"K Lyons","year":"1998","unstructured":"Lyons, K., Meijer, H., Rappaport, D. (1998) Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications 2(1), 1\u201324","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"6_CR30","unstructured":"Marriott, K., Stuckey, P. J., Tarn, V., He, W. (in press) Removing node overlapping in graph layout using constrained optimization. Constraints, 1\u201331"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K. (1995) Layout adjustment and the mental map. Journal of Visual Languages and Computing 6(2), 183\u2013210","journal-title":"Journal of Visual Languages and Computing"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"North, S. C, Woodhull, G. (2001) Online hierarchical graph drawing. In: P. Mutzel, M. J\u00fcnger, S. Leipert (eds.) Graph Drawing\u2019 01, Lecture Notes in Computer Science 2265, Springer Verlag, 232\u2013246","DOI":"10.1007\/3-540-45848-4_19"},{"key":"6_CR33","volume-title":"Computational Geometry in C","author":"J ORourke","year":"1994","unstructured":"O\u2019Rourke, J. (1994) Computational Geometry in C. Cambridge University Press, Cambridge"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/T-C.1969.222678","volume":"18","author":"JW Sammon Jr.","year":"1969","unstructured":"Sammon, Jr., J. W. (1969) A nonlinear mapping for data structure analysis. IEEE Transactions on Computers 18, 401\u2013409","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02289630","volume":"27","author":"RN Shepard","year":"1962","unstructured":"Shepard, R. N. (1962) The analysis of proximities: multidimensional scaling with an unknown distance function. Psychometrika 27, 125\u2013140; 219\u2013246","journal-title":"Psychometrika"},{"key":"6_CR36","unstructured":"Thain, D. (2000) netmap. www.cs.wisc.edu\/~thain\/projects\/netmap"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF02289530","volume":"30","author":"WS Torgeson","year":"1965","unstructured":"Torgeson, W. S. (1965) Multidimensional scaling of similarity. Psychometrika 30, 379\u2013393","journal-title":"Psychometrika"},{"key":"6_CR38","unstructured":"van Heesch, D. (2002) Doxygen. http:\/\/www.stack.nl\/~dimitri\/doxygen\/"},{"key":"6_CR39","unstructured":"Vo, K.-P. (1997) Libcdt: A general and efficient container data type library. In: Proceedings of Summer\u2019 97 Usenix Conference"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Walshaw, C. (2000) A Multilevel Algorithm for Force-Directed Graph Drawing. In: J. Marks (ed.) Graph Drawing\u2019 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 171\u2013182","DOI":"10.1007\/3-540-44541-2_17"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Wills, G. (1997) Nicheworks \u2014 interactive visualization of very large graphs. In: G. Di Battista (ed.) Graph Drawing\u2019 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 403\u2013414","DOI":"10.1007\/3-540-63938-1_85"},{"key":"6_CR42","first-page":"520","volume":"6","author":"L Wong","year":"2001","unstructured":"Wong, L. (2001) A protein interaction extraction system. In: Pacific Symposium on Biocomputing 6, 520\u2013531","journal-title":"Pacific Symposium on Biocomputing"}],"container-title":["Mathematics and Visualization","Graph Drawing Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18638-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:07:23Z","timestamp":1606187243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18638-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642622144","9783642186387"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18638-7_6","relation":{},"ISSN":["1612-3786"],"issn-type":[{"value":"1612-3786","type":"print"}],"subject":[],"published":{"date-parts":[[2004]]}}}