{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T06:31:34Z","timestamp":1719642694473},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0020-0190(00)00174-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:28:16Z","timestamp":1027607296000},"page":"73-79","source":"Crossref","is-referenced-by-count":6,"title":["The symmetry number problem for trees"],"prefix":"10.1016","volume":"79","author":[{"given":"Kien-Weh","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00174-5_BIB001","series-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Battista","year":"1999"},{"key":"10.1016\/S0020-0190(00)00174-5_BIB002","series-title":"Computing and Combinatorics (COCOON'97)","first-page":"202","article-title":"Spring algorithms and symmetry","volume":"1276","author":"Eades","year":"1997"},{"issue":"5","key":"10.1016\/S0020-0190(00)00174-5_BIB003","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","article-title":"Faster scaling algorithms for network problems","volume":"18","author":"Gabow","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00174-5_BIB004","series-title":"Graph Drawing'98","first-page":"198","article-title":"Drawing algorithms for series-parallel digraphs in two and three dimensions","volume":"1547","author":"Hong","year":"1998"},{"key":"10.1016\/S0020-0190(00)00174-5_BIB005","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawer","year":"1976"},{"key":"10.1016\/S0020-0190(00)00174-5_BIB006","first-page":"159","article-title":"Fast detection and display of symmetry in trees","volume":"64","author":"Manning","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/S0020-0190(00)00174-5_BIB007","series-title":"Geometric symmetry in graphs","author":"Manning","year":"1990"},{"key":"10.1016\/S0020-0190(00)00174-5_BIB008","series-title":"CRC Handbook of Discrete and Computational Geometry","article-title":"Graph drawing","author":"Tamassia","year":"1997"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:23:59Z","timestamp":1556439839000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0020019000001745"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00174-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}