{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:04:08Z","timestamp":1743077048475,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":42,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441903112"},{"type":"electronic","value":"9781441903129"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-4419-0312-9_3","type":"book-chapter","created":{"date-parts":[[2009,10,19]],"date-time":"2009-10-19T16:06:33Z","timestamp":1255968393000},"page":"41-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["From Tree to Graph - Experiments with E-Spring Algorithm"],"prefix":"10.1007","author":[{"given":"Pushpa","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Kang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Mao Lin","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,30]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G.D. Battista","year":"1994","unstructured":"Battista, G.D., Eades, P.: Algorithms for drawing graphs: an annotated bibliography. Computational Geometry. 4, 235\u2013282 (1994)","journal-title":"Computational Geometry"},{"key":"3_CR2","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G.D. Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, New Jersey, USA (1999)"},{"key":"3_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill, New York, USA (2001)"},{"key":"3_CR4","first-page":"162","volume-title":"Proceedings of the Symposium on Graph Drawing","author":"I.F. Cruz","year":"1995","unstructured":"Cruz, I.F., Twarog, J.P.: 3D Graph Drawing with Simulated Annealing. In: Proceedings of the Symposium on Graph Drawing, pp. 162\u2013165. Springer-Verlag, London, UK (1995)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing, ACM Transactions on Graphics. 15, 301\u2013331 (1996)","journal-title":"ACM Transactions on Graphics"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijksta","year":"1959","unstructured":"Dijksta, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik. 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/IV.2008.11","volume-title":"Proceedings of the 12th International Conference Information Visualisation","author":"J. Dolulil","year":"2008","unstructured":"Dolulil, J., Katreniakova, J.: Edge Routing with Fixed Node Positions. In: Proceedings of the 12th International Conference Information Visualisation, pp. 626\u2013631. IEEE Computer Society Washington, DC, USA (2008)"},{"key":"3_CR8","first-page":"8","volume-title":"Proceedings 14th Intl. Symp. Graph Drawing (GD \u201906)","author":"T. Dwyer","year":"2007","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Integrating edge routing into force-directed layout. In: Proceedings 14th Intl. Symp. Graph Drawing (GD \u201906), pp. 8\u201319. Springer-Verlag, Berlin, Heidelberg (2007)"},{"key":"3_CR9","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium. 42, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.7155\/jgaa.00029","volume":"4","author":"P. Eades","year":"2000","unstructured":"Eades, P., Huang, M.L.: Navigating Clustered Graphs using Force-Directed Methods, Journal of Graph Algorithms and Applications. 4, 157\u2013181 (2000)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"3_CR11","first-page":"83","volume":"6","author":"P. Eades","year":"1995","unstructured":"Eades, P., Lai, W., Misue, K., Sugiyama, K.: Layout adjustment and the mental map. Journal of Visual Languages and Computing. 6, 83\u2013210 (1995)","journal-title":"Journal of Visual Languages and Computing"},{"key":"3_CR12","unstructured":"Forster, M.: Crossings in Clustered Level Graphs, Ph.D.Dissertation (2004)"},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/11618058","volume-title":"Graph Drawing","author":"P. Healy","year":"2006","unstructured":"Healy, P., Nikolov, N.S.: Graph Drawing. Springer-Verlag, Berlin, Heidelberg (2006)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"2821","DOI":"10.1016\/j.ins.2007.02.016","volume":"177","author":"X. Huang","year":"2007","unstructured":"Huang, X., Lai, W., Sajeev, A.S.M., Gao, J.: A new algorithm for removing node overlapping in graph visualization. Information Sciences. 177, 2821\u20132844 (2007)","journal-title":"Information Sciences"},{"key":"3_CR15","first-page":"347","volume-title":"Proceedings 14th Annual ACM Symposium of Computational Geometry (SoCG\u201998)","author":"K.G. Kakoulis","year":"1998","unstructured":"Kakoulis, K.G., Tollis, I.G.: A unified approach to labeling graphical features. In: Proceedings 14th Annual ACM Symposium of Computational Geometry (SoCG\u201998), pp. 347\u2013356. ACM New York, NY, USA (1998)"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing graphs, methods and models","author":"M. Kaufmann","year":"2001","unstructured":"Kaufmann, M., Dorothea, W.: Drawing graphs, methods and models. Springer-Verlag, Berlin, Heidelberg (2001)"},{"key":"3_CR17","volume-title":"Bayesian Artificial Intelligence","author":"K.B. Korb","year":"2004","unstructured":"Korb, K.B., Nicholson, A.E.: Bayesian Artificial Intelligence. Chapman & Hall, London, UK (2004)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. American Mathematical Society. 7, 48\u201350 (1956)","journal-title":"American Mathematical Society"},{"key":"3_CR19","first-page":"363","volume-title":"Proceedings IEEE International Conference on e-Business Engineering","author":"P. Kumar","year":"2007","unstructured":"Kumar, P., Zhang, K.: Social Network Analysis of Online Marketplaces. In: Proceedings IEEE International Conference on e-Business Engineering, pp. 363\u2013367. IEEE Computer Society Washington, DC, USA (2007)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/IV.2008.85","volume-title":"Proceedings 12th International Conference on Information Visualization","author":"P. Kumar","year":"2008","unstructured":"Kumar, P., Zhang, K., Wang, Y.: Visualization of Clustered Directed Acyclic Graphs without Node Overlapping. In: Proceedings 12th International Conference on Information Visualization, pp. 38\u201343. IEEE Computer Society Washington, DC, USA (2008)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1145\/1529282.1529685","volume-title":"Proceedings of the 24th Annual ACM Symposium on Applied Computing (SAC \u201809)","author":"P. Kumar","year":"2009","unstructured":"Kumar, P., Zhang K.: Visualization of Clustered Directed Acyclic Graphs with Node Interleaving. In: Proceedings of the 24th Annual ACM Symposium on Applied Computing (SAC \u201809), pp. 1800\u20131805. ACM New York, NY, USA (2009)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Kumar, P., Zhang, K.: Node Overlap Removal in Clustered Directed Acyclic Graphs. Journal of Visual Languages and Computing (JVLC). Article in press, doi:10.1016\/j.jvlc.2009.04.007 (2009)","DOI":"10.1016\/j.jvlc.2009.04.007"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1109\/CGI.2001.934697","volume-title":"Proceedings of Computer Graphics International (CGI \u201901)","author":"W. Lai","year":"2001","unstructured":"Lai, W.: Layout Adjustment and Boundary Detection for a Diagram. In: Proceedings of Computer Graphics International (CGI \u201901), pp. 351\u2013354. IEEE Computer Society Washington, DC, USA (2001)"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(01)00194-6","volume":"81","author":"W. Lai","year":"2002","unstructured":"Lai, W., Eades, P.: Removing edge-node intersections in drawings of graphs. Information Processing Letters. 81, 105\u2013110 (2002)","journal-title":"Information Processing Letters"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/net.3230110307","volume":"11","author":"R.C. Larson","year":"1981","unstructured":"Larson, R.C., Li, V.O.K.: Finding minimum rectilinear distance paths in the paths in the presence of barriers. Networks. 11, 285\u2013304 (1981)","journal-title":"Networks"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D.T. Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks. 14, 393\u2013410 (1984)","journal-title":"Networks"},{"key":"3_CR27","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"34","author":"C.E. Leiserson","year":"1985","unstructured":"Leiserson, C.E.: Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Transactions on Computers. 34, 892\u2013901 (1985)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Leymann, F.: Web Services Flow Language (WSFL 1.0), IBM (2001)","DOI":"10.1007\/3-540-45752-6_1"},{"key":"3_CR29","first-page":"131","volume-title":"Proceedings of the 2005 Asia-Pacific symposium on Information visualization (APVIS \u201905)","author":"W. Li","year":"2005","unstructured":"Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: Proceedings of the 2005 Asia-Pacific symposium on Information visualization (APVIS \u201905), pp. 131\u2013140. Australian Computer Society, Inc. Darlinghurst, Australia (2005)"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"22560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"Lozano-Perez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Communications of ACM. 22, 22560\u201322570 (1979)","journal-title":"Communications of ACM"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1022371615202","volume":"8","author":"K. Marriott","year":"2003","unstructured":"Marriott, K., Stuckey, P., Vam, T., He, W.: Removing Node Overlapping in Graph Layout Using Constrained Optimization. Constraints. 8, 143\u2013171 (2003)","journal-title":"Constraints"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jvlc.2006.03.004","volume":"19","author":"H.A.D. Nascimento","year":"2008","unstructured":"Nascimento, H.A.D., Eades, P.: User Hints for map labeling. Journal of Visual Languages and Computing. 19, 39\u201374 (2008)","journal-title":"Journal of Visual Languages and Computing"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1109\/12.736444","volume":"47","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Interactive Orthogonal Graph Drawing. IEEE Transactions on Computers. 47, 1297\u20131309 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR34","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal. 36, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"3_CR35","first-page":"435","volume-title":"Proceedings of the Symposium on Graph Drawing (GD \u201995)","author":"H.C. Purchase","year":"1995","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating Graph Drawing Aesthetics. In: Proceedings of the Symposium on Graph Drawing (GD \u201995), pp. 435\u2013446. Springer-Verlag, London, UK (1995)"},{"key":"3_CR36","first-page":"197","volume-title":"Proceedings of the 8th International Symposium on Graph Drawing (GD \u201900)","author":"A. Quigley","year":"2000","unstructured":"Quigley A., Eades, P.: Graph Drawing, Clustering, and Visual Abstraction. In: Proceedings of the 8th International Symposium on Graph Drawing (GD \u201900), pp. 197\u2013210. Springer-Verlag, Berlin, Heidelberg (2000)"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1109\/IV.2005.19","volume-title":"Proceedings of the Ninth International Conference on Information Visualization (IV \u201905)","author":"M. Taylor","year":"2005","unstructured":"Taylor, M., Rodgers, P.: Applying Graphical Design Techniques to Graph Visualization. In: Proceedings of the Ninth International Conference on Information Visualization (IV \u201905), pp. 651\u2013656. IEEE Computer Society Washington, DC, USA (2005)"},{"key":"3_CR38","unstructured":"ConceptDraw, http:\/\/www.conceptdraw.com\/en\/products\/cd5\/main.php"},{"key":"3_CR39","unstructured":"Home of Graphdrawing, http:\/\/www.graphdrawing.org"},{"key":"3_CR40","unstructured":"Graphviz - Graph Visualization Software, http:\/\/www.graphviz.org"},{"key":"3_CR41","unstructured":"Microsoft Office Online \u2013 Visio, http:\/\/office.microsoft.com\/en-us\/visio\/default.aspx"},{"key":"3_CR42","unstructured":"yWorks, http:\/\/www.yworks.com\/products\/yfiles\/doc\/developers-guide\/index.html"}],"container-title":["Visual Information Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-0312-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T21:34:11Z","timestamp":1675892051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-0312-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781441903112","9781441903129"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-0312-9_3","relation":{},"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"30 September 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}