{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T09:59:38Z","timestamp":1760954378381},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":7655,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0166-218x(92)90112-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"13-35","source":"Crossref","is-referenced-by-count":23,"title":["Fast detection and display of symmetry in outerplanar graphs"],"prefix":"10.1016","volume":"39","author":[{"given":"Joseph","family":"Manning","sequence":"first","affiliation":[]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90112-N_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(92)90112-N_BIB2","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/TC.1985.1676605","article-title":"On symmetry detection","volume":"34","author":"Atallah","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90112-N_BIB3","article-title":"Graph Theory: An Introductory Course","volume":"63","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0166-218X(92)90112-N_BIB4","series-title":"Graph Theory with Applications","author":"Booth","year":"1976"},{"key":"10.1016\/0166-218X(92)90112-N_BIB5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","article-title":"Lexicographically least circular substrings","volume":"10","author":"Booth","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90112-N_BIB6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0210015","article-title":"Linear time automorphism algorithms for trees, interval graphs, and planar graphs","volume":"10","author":"Colbourn","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90112-N_BIB7","first-page":"229","article-title":"On straight line representation of planar graphs","volume":"11","author":"F\u00e1ry","year":"1948","journal-title":"Acta Sci. Math."},{"key":"10.1016\/0166-218X(92)90112-N_BIB8","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(92)90112-N_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(86)90097-9","article-title":"Optimal algorithms for finding the symmetrics of a planar point set","volume":"22","author":"Highnam","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90112-N_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90112-N_BIB11","first-page":"1","article-title":"Computational complexity of geometric symmetry detection in graphs","volume":"507","author":"Manning","year":"1991"},{"key":"10.1016\/0166-218X(92)90112-N_BIB12","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\/0166-218X(92)90112-N_BIB13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","article-title":"Linear algorithms to recognize outerplanar and maximal outerplanar graphs","volume":"9","author":"Mitchell","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90112-N_BIB14","first-page":"675","article-title":"Outerplanar graphs: Characterizations, testing, coding, and counting","volume":"26","author":"Syslo","year":"1978","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Sci. Math. Astron. Phys."},{"key":"10.1016\/0166-218X(92)90112-N_BIB15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01901268","article-title":"Optimal algorithms for symmetry detection in two and three dimensions","volume":"1","author":"Wolter","year":"1985","journal-title":"The Visual Computer"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290112N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290112N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:59Z","timestamp":1555136639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290112N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["0166218X9290112N"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90112-n","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}