{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:52:04Z","timestamp":1752461524055},"reference-count":5,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9080,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The absolute center of a network is any vertex or point on an edge such that the distance from it to the vertex farthest from it is as small as possible. This paper presents a polynomial time algorithm for finding an absolute center. This algorithm is combinatorial in nature and requires only knowledge of the shortest path distances between all pairs of vertices.<\/jats:p>","DOI":"10.1002\/net.3230110404","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T12:51:32Z","timestamp":1178887892000},"page":"351-355","source":"Crossref","is-referenced-by-count":17,"title":["A polynomial time algorithm for finding the absolute center of a network"],"prefix":"10.1002","volume":"11","author":[{"given":"Edward","family":"Minieka","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graph Theory, An Algorithmic Approach","author":"Christofides N.","year":"1975"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_1_4_2","volume-title":"Locations on Networks","author":"Handler G.","year":"1979"},{"key":"e_1_2_1_5_2","volume-title":"Optimization Algorithms for Networks and Graphs","author":"Minieka E.","year":"1978"},{"key":"e_1_2_1_6_2","volume-title":"Graphs and Networks, An Introduction","author":"Price W. L.","year":"1971"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230110404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:47:15Z","timestamp":1699789635000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["10.1002\/net.3230110404"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110404","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}