{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:36:30Z","timestamp":1649147790045},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5707,"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":[[1997,12]]},"DOI":"10.1016\/s0166-218x(97)00094-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"263-268","source":"Crossref","is-referenced-by-count":1,"title":["A doubly cyclic channel assignment problem"],"prefix":"10.1016","volume":"80","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00094-2_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(97)00094-2_BIB2","first-page":"1497","article-title":"Frequency assignment","volume":"68","author":"Hale","year":"1980"},{"key":"10.1016\/S0166-218X(97)00094-2_BIB3","article-title":"Polyhedral analysis of channel assignment problems: (I) Tours","author":"Janssen","year":"1996","journal-title":"Research Report CDAM-96-17, LSE"},{"key":"10.1016\/S0166-218X(97)00094-2_BIB4","doi-asserted-by":"crossref","unstructured":"R.A. Leese, A unified approach to the assignment of radio channels on a regular hexagonal grid, IEEE Trans, on Vehicular Technology, to appear.","DOI":"10.1109\/25.653071"},{"key":"10.1016\/S0166-218X(97)00094-2_BIB5","series-title":"Proc. Internat. Symp. on Electromagnetic Compatibility","first-page":"127","article-title":"A fresh look at channel assignment in uniform networks","author":"Leese","year":"1997"},{"key":"10.1016\/S0166-218X(97)00094-2_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","article-title":"A characterization of the minimum cycle mean in a digraph","volume":"23","author":"Karp","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00094-2_BIB7","article-title":"Graph labelling and radio channel assignment","author":"Van Den Heuvel","year":"1996","journal-title":"Report CDAM-96-23"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000942?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000942?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:56Z","timestamp":1556666816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0166218X97000942"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00094-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}