{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:35:26Z","timestamp":1648528526492},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"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":8659,"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":[[1989,11]]},"DOI":"10.1016\/0166-218x(89)90009-7","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T12:47:25Z","timestamp":1032266845000},"page":"311-315","source":"Crossref","is-referenced-by-count":0,"title":["The absolute center of a unicyclic network"],"prefix":"10.1016","volume":"25","author":[{"given":"Pentti","family":"H\u00e4m\u00e4l\u00e4inen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(89)90009-7_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(84)90004-0","article-title":"The absolute centre of a graph","volume":"7","author":"Cunninghame-Green","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(89)90009-7_BIB2","article-title":"Algorithms for some center problems on networks","volume":"6","author":"H\u00e4m\u00e4inen","year":"1984","journal-title":"Jyv\u00e4skyl\u00e4 Studies in Computer Science, Economics and Statistics"},{"key":"10.1016\/0166-218X(89)90009-7_BIB3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/trsc.15.2.98","article-title":"Linear algorithms for finding the Jordan center and path center of a tree","volume":"15","author":"Hedetniemi","year":"1981","journal-title":"Transportation Sci."},{"key":"10.1016\/0166-218X(89)90009-7_BIB4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","article-title":"Minimax location of a facility in an undirected tree graph","volume":"7","author":"Handler","year":"1973","journal-title":"Transportation Sci."},{"key":"10.1016\/0166-218X(89)90009-7_BIB5","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems, I: The p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(89)90009-7_BIB6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/net.3230110404","article-title":"A polynomial time algorithm for finding the absolute center of a network","volume":"11","author":"Minieka","year":"1981","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:50:23Z","timestamp":1554814223000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X89900097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0166218X89900097"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(89)90009-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}