乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:29:30Z","timestamp":1648758570992},"reference-count":22,"publisher":"Elsevier BV","issue":"10-11","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100006109","name":"VEGA","doi-asserted-by":"crossref","award":["2\/0136\/12"],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1016\/j.dam.2012.12.026","type":"journal-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T23:00:47Z","timestamp":1358463647000},"page":"1402-1408","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Antibandwidth and cyclic antibandwidth of Hamming graphs"],"prefix":"10.1016","volume":"161","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[]},{"given":"L\u2019ubom\u00edr","family":"T\u00f6r\u00f6k","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2012.12.026_br000005","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.tcs.2008.07.029","article-title":"On the bandwidth of 3-dimensional Hamming graphs","volume":"407","author":"Balogh","year":"2008","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2012.12.026_br000010","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10732-010-9124-4","article-title":"Memetic algorithm for the antibandwidth maximization problem","volume":"17","author":"Bansal","year":"2011","journal-title":"J. Heuristics"},{"key":"10.1016\/j.dam.2012.12.026_br000015","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s00500-009-0538-6","article-title":"A memetic algorithm for the cyclic antibandwidth maximization problem","volume":"15","author":"Bansal","year":"2011","journal-title":"Soft Comput."},{"key":"10.1016\/j.dam.2012.12.026_br000020","doi-asserted-by":"crossref","first-page":"6408","DOI":"10.1016\/j.disc.2008.10.019","article-title":"Antibandwidth of complete k-ary trees","volume":"309","author":"Calamoneri","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2012.12.026_br000025","unstructured":"P. Cappanera, A survey on obnoxious facility location problems, Technical Report TR-99-11, Dipartimento di Informatica, Uni. di Pisa, 1999."},{"key":"10.1016\/j.dam.2012.12.026_br000030","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/568522.568523","article-title":"A survey of graph layout problems","volume":"34","author":"D\u00edaz","year":"2002","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.dam.2012.12.026_br000035","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0012-365X(98)00346-X","article-title":"Hamiltonian powers in threshold and arborescent comparability graphs","volume":"202","author":"Donnely","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2012.12.026_br000040","first-page":"#DS6","article-title":"Graph labeling","volume":"16","author":"Gallian","year":"2009","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2012.12.026_br000045","first-page":"262","article-title":"The separation number","volume":"37","author":"G\u00f6bel","year":"1994","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2012.12.026_br000050","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"60","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.dam.2012.12.026_br000055","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0166-218X(99)00082-7","article-title":"On an isoperimetric problem for Hamming graphs","volume":"95","author":"Harper","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2012.12.026_br000060","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0304-3975(03)00052-5","article-title":"On the bandwidth of a Hamming graph","volume":"301","author":"Harper","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2012.12.026_br000065","series-title":"Proc.: 18th Intl. Symposium on Graph Drawing","first-page":"274","article-title":"On maximum differential graph coloring","volume":"vol. 6502","author":"Hu","year":"2011"},{"key":"10.1016\/j.dam.2012.12.026_br000070","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<31::AID-JGT3>3.0.CO;2-G","article-title":"Powers of Hamiltonian paths in interval graphs","volume":"28","author":"Isaak","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2012.12.026_br000075","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1137\/0213040","article-title":"On some variants of the bandwidth minimization problem","volume":"13","author":"Leung","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2012.12.026_br000080","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/net.3230190604","article-title":"On the separation number of a graph","volume":"19","author":"Miller","year":"1989","journal-title":"NETWORKS"},{"key":"10.1016\/j.dam.2012.12.026_br000085","doi-asserted-by":"crossref","first-page":"3541","DOI":"10.1016\/j.disc.2007.12.058","article-title":"Antibandwidth and cyclic antibandwidth of meshes and hypercubes","volume":"309","author":"Raspaud","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2012.12.026_br000090","doi-asserted-by":"crossref","first-page":"3769","DOI":"10.1016\/j.tcs.2009.05.011","article-title":"Separation numbers of trees","volume":"410","author":"Tao","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2012.12.026_br000095","series-title":"Proc.: 20th Intl. Workshop on Combinatorial Algorithms","first-page":"471","article-title":"Antibandwidth of d-dimensional meshes","volume":"vol. 5874","author":"T\u00f6r\u00f6k","year":"2009"},{"key":"10.1016\/j.dam.2012.12.026_br000100","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.disc.2009.03.029","article-title":"Antibandwidth of three-dimensional meshes","volume":"310","author":"T\u00f6r\u00f6k","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2012.12.026_br000105","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/j.dam.2008.12.004","article-title":"On explicit formulas for bandwidth and antibandwidth of hypercubes","volume":"157","author":"Xiaohan","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2012.12.026_br000110","first-page":"16","article-title":"Dual bandwidth of some special trees","volume":"35","author":"Yao","year":"2003","journal-title":"J. Zhengzhou Univ. Nat. Sci. Ed."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13000152?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13000152?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T12:27:45Z","timestamp":1539952065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X13000152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":22,"journal-issue":{"issue":"10-11","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S0166218X13000152"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2012.12.026","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2013,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Antibandwidth and cyclic antibandwidth of Hamming graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2012.12.026","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}