{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:24Z","timestamp":1794516744035,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":20,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_654","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:20Z","timestamp":1461269000000},"page":"2182-2189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symmetric Graph Drawing"],"prefix":"10.1007","author":[{"given":"Seokhee","family":"Hong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"17","key":"654_CR191161","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1016\/j.dam.2007.04.027","volume":"155","author":"D Abelson","year":"2007","unstructured":"Abelson D, Hong S, Taylor DE (2007) Geometric automorphism groups of graphs. Discret Appl Math 155(17):2211\u20132226. Elsevier","journal-title":"Discret Appl Math"},{"key":"654_CR191162","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4034-9","volume-title":"Groups and symmetry","author":"MA Armstrong","year":"1988","unstructured":"Armstrong MA (1988) Groups and symmetry. Springer, New York"},{"key":"654_CR191163","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-003-0409-3","volume":"98","author":"C Buchheim","year":"2003","unstructured":"Buchheim C, Junger M (2003) Detecting symmetries by branch and cut. Math Progr (Ser B) 98:369\u2013384","journal-title":"Math Progr (Ser B)"},{"key":"654_CR191164","first-page":"153","volume-title":"Progress in graph theory","author":"N Chiba","year":"1984","unstructured":"Chiba N, Yamanouchi T, Nishizeki T (1984) Linear algorithms for convex drawings of planar graphs. In: Adrian Bondy J, Murty USR (eds) Progress in graph theory. Academic, Toronto\/Orlando, pp\u00a0153\u2013173"},{"key":"654_CR191165","volume-title":"Handbook of graph drawing and visualisation","author":"P Eades","year":"2013","unstructured":"Eades P, Hong S (2013) Detection and display of symmetries. In: Tamassia R (ed) Handbook of graph drawing and visualisation. Chapman and Hall\/CRC"},{"issue":"2","key":"654_CR191166","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(99)00239-X","volume":"240","author":"P Eades","year":"2000","unstructured":"Eades P, Lin X (2000) Spring algorithms and symmetry. Theor Comput Sci 240(2):379\u2013405","journal-title":"Theor Comput Sci"},{"key":"654_CR191167","first-page":"411","volume-title":"Linear algorithms for testing isomorphism of planar graphs","author":"M Fontet","year":"1976","unstructured":"Fontet M (1976) Linear algorithms for testing isomorphism of planar graphs. In: Proceedings of third colloquium on automata, languages and programming, Edinburgh, pp\u00a0411\u2013423"},{"key":"654_CR191168","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-45848-4_16","volume-title":"Drawing graphs symmetrically in three dimensions","author":"S Hong","year":"2002","unstructured":"Hong S (2002) Drawing graphs symmetrically in three dimensions. In: Proceeding of graph drawing 2001, Vienna. Lecture notes in computer science, vol\u00a02265. Springer, pp\u00a0189\u2013204"},{"issue":"2","key":"654_CR191169","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-002-1011-4","volume":"36","author":"S Hong","year":"2003","unstructured":"Hong S, Eades P (2003) Drawing trees symmetrically in three dimensions. Algorithmica 36(2):153\u2013178. Springer","journal-title":"Algorithmica"},{"key":"654_CR191170","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-24587-2_42","volume-title":"Algorithms and computation","author":"S Hong","year":"2003","unstructured":"Hong S, Eades P (2003) Symmetric layout of disconnected graphs. In: Algorithms and computation (Proceedings of ISAAC 2003, Kyoto). Lecture notes in computer science, vol\u00a02906. Springer, Berlin\/New York, pp\u00a0405\u2013414"},{"issue":"3","key":"654_CR191171","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.comgeo.2004.04.004","volume":"29","author":"S Hong","year":"2004","unstructured":"Hong S, Eades P (2004) Linkless symmetric drawings of series parallel digraphs. Comput Geom Theory Appl 29(3):191\u2013222. Elsevier","journal-title":"Comput Geom Theory Appl"},{"issue":"2","key":"654_CR191172","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00453-004-1132-z","volume":"42","author":"S Hong","year":"2005","unstructured":"Hong S, Eades P (2005) Drawing planar graphs symmetrically II: biconnected graphs. Algorithmica 42(2):159\u2013197. Springer","journal-title":"Algorithmica"},{"issue":"1","key":"654_CR191173","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00453-005-1149-y","volume":"44","author":"S Hong","year":"2006","unstructured":"Hong S, Eades P (2006) Drawing planar graphs symmetrically III: oneconnected graphs. Algorithmica 44(1):67\u2013100. Springer","journal-title":"Algorithmica"},{"issue":"3\u20134","key":"654_CR191174","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0925-7721(00)00020-1","volume":"17","author":"S Hong","year":"2000","unstructured":"Hong S, Eades P, Lee S (2000) Drawing series parallel digraphs symmetrically. Comput Geom Theory Appl 17(3\u20134):165\u2013188","journal-title":"Comput Geom Theory Appl"},{"issue":"2","key":"654_CR191175","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00454-006-1231-5","volume":"36","author":"S Hong","year":"2006","unstructured":"Hong S, McKay B, Eades P (2006) A linear time algorithm for constructing maximally symmetric straight-line drawings of triconnected planar graphs. Discret Comput Geom 36(2):283\u2013311. Springer","journal-title":"Discret Comput Geom"},{"issue":"2","key":"654_CR191176","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s00453-008-9275-y","volume":"58","author":"S Hong","year":"2010","unstructured":"Hong S, Nagamochi H (2010) Linear time algorithm for symmetric convex drawings of planar graphs. Algorithmica 58(2):433\u2013460. Springer","journal-title":"Algorithmica"},{"key":"654_CR191177","first-page":"172","volume-title":"Linear time algorithm for isomorphism of planar graphs","author":"JE Hopcroft","year":"1974","unstructured":"Hopcroft JE, Wong JK (1974) Linear time algorithm for isomorphism of planar graphs. In: Proceedings of ACM symposium on theory of computing, Seattle, pp\u00a0172\u2013184"},{"issue":"1","key":"654_CR191178","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A Lubiw","year":"1981","unstructured":"Lubiw A (1981) Some NP-complete problems similar to graph isomorphism. SIAM J Comput 10(1):11\u201321","journal-title":"SIAM J Comput"},{"key":"654_CR191179","first-page":"159","volume":"64","author":"J Manning","year":"1988","unstructured":"Manning J, Atallah MJ (1988) Fast detection and display of symmetry in trees. Congr Numer 64:159\u2013169","journal-title":"Congr Numer"},{"key":"654_CR191180","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(92)90112-N","volume":"39","author":"J Manning","year":"1992","unstructured":"Manning J, Atallah MJ (1992) Fast detection and display of symmetry in outerplanar graphs. Discret Appl Math 39:13\u201335","journal-title":"Discret Appl Math"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:54:28Z","timestamp":1792108468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_654","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}