{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:24:49Z","timestamp":1762032289201},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00239-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:58:49Z","timestamp":1027605529000},"page":"379-405","source":"Crossref","is-referenced-by-count":40,"title":["Spring algorithms and symmetry"],"prefix":"10.1016","volume":"240","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00239-X_BIB1","series-title":"Graph Theory with Application","author":"Bondy","year":"1977"},{"issue":"15","key":"10.1016\/S0304-3975(99)00239-X_BIB2","article-title":"On the optimal layout of planar graphs with fixed boundary","volume":"16","author":"Becker","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB3","unstructured":"R. Davidson, Harel, Drawing graphs nicely using simulated annealing, Tech. Rep. Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 1989."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Comput. Geometry: Theory Appl."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","article-title":"Area requirement and symmetry display of planar upward drawings","volume":"7","author":"Di Battista","year":"1992","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB6","first-page":"149","article-title":"A heuristic for graph drawing","volume":"42","author":"Eades","year":"1984","journal-title":"Congr. Numer."},{"issue":"2","key":"10.1016\/S0304-3975(99)00239-X_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1142\/S0218195996000101","article-title":"An algorithm for drawing a hierarchical graph","volume":"6","author":"Eades","year":"1996","journal-title":"Internat. J. Comput. Geometry Appl."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB8","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","article-title":"Graph drawing by force-directed placement","volume":"21","author":"Fruchterman","year":"1991","journal-title":"Software-Practice Experience"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB9","series-title":"Topics in Algebra","author":"Herstein","year":"1964"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB10","doi-asserted-by":"crossref","unstructured":"S.-H. Hong, P. Eades, S.-H. Lee, Finding planar geometric automorphisms in planar graphs, ISAAC 98: Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1533, Springer, Berlin, 1998, pp. 277\u2013286","DOI":"10.1007\/3-540-49381-6_30"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB11","unstructured":"S.-H. Hong, P. Eades, A. Quigley, S.-H. Lee, Drawing algorithms for series-parallel digraphs in two and three dimensions, Graph Drawing 98, Lecture Notes in Computer Science Vol. 1547, Springer, Berlin, 1998, pp. 198\u2013209."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","article-title":"Automatic display of network structures for human understanding","volume":"31","author":"Kamada","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB13","unstructured":"X. Lin, Analysis of algorithms for drawing graphs, Ph.D Thesis, University of Queensland, 1992."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB14","doi-asserted-by":"crossref","unstructured":"R. Lipton, S. North, J. Sandberg, A method for drawing graphs, Proc. ACM Symp. on Computational Geometry, 1985, pp. 153\u2013160.","DOI":"10.1145\/323233.323254"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB15","series-title":"Proc. Great Lakes Computer Science Conference, Lecture Notes in Computer Science","article-title":"Computational complexity of geometric symmetry detection in graphs","author":"Manning","year":"1990"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB16","first-page":"159","article-title":"Fast detection and symmetry in trees","volume":"64","author":"Manning","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB17","unstructured":"J. Manning, M.J. Atallah, Fast detection and display of symmetry in outerplanar graphs, Technical Report CSD-TR-606, Dept. of Computeer Sciences, Purdue Univ., West Lafayette, IN, 1986."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB18","series-title":"Transformation Geometry \u2014 An Introduction to Symmetry","author":"Martin","year":"1982"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawings of trees","volume":"7","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB20","unstructured":"F.W. Sears, M.W. Zemansky, University Physics, Addition-Wesley, 1963."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB21","series-title":"Advanced Calculus","author":"Taylor","year":"1955"},{"issue":"3","key":"10.1016\/S0304-3975(99)00239-X_BIB22","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jvlc.1995.1013","article-title":"Graph drawing by the magnetic spring model","volume":"6","author":"Sugiyama","year":"1995","journal-title":"J. Visual Languages Comput."},{"issue":"3","key":"10.1016\/S0304-3975(99)00239-X_BIB23","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","article-title":"Convex representations of graphs","volume":"10","author":"Tutte","year":"1960","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB24","doi-asserted-by":"crossref","unstructured":"W.T. Tutte, How to draw a graph, Proc. London Math. Soc. 13(3) (1963) 304\u2013320.","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"10.1016\/S0304-3975(99)00239-X_BIB25","unstructured":"D. Tunkelang, A practical approach to drawing undirected graphs, Technical Report, Canegie Mellon University, 1994."},{"key":"10.1016\/S0304-3975(99)00239-X_BIB26","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900239X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900239X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:37:12Z","timestamp":1578519432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759900239X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S030439759900239X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00239-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}