乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:49:33Z","timestamp":1720334973807},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1016\/j.ipl.2017.12.009","type":"journal-article","created":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T18:11:48Z","timestamp":1515003108000},"page":"1-4","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Path multicoloring in spider graphs with even color multiplicity"],"prefix":"10.1016","volume":"133","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1496-9299","authenticated-orcid":false,"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[]},{"given":"Christina","family":"Karousatou","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Katerina","family":"Potika","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ipl.2017.12.009_br0010","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TNET.2009.2014226","article-title":"Complexity of wavelength assignment in optical network optimization","volume":"17","author":"Andrews","year":"2009","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"10.1016\/j.ipl.2017.12.009_br0020","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.jcss.2005.08.001","article-title":"Minimizing maximum fiber requirement in optical networks","volume":"72","author":"Andrews","year":"2006","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.ipl.2017.12.009_br0030","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/TNET.2011.2173948","article-title":"On a noncooperative model for wavelength assignment in multifiber optical networks","volume":"20","author":"Bampas","year":"2012","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.ipl.2017.12.009_br0040","series-title":"CIAC 2013 Proc.","first-page":"25","article-title":"Selfish resource allocation in optical networks","volume":"vol. 7878","author":"Bampas","year":"2013"},{"issue":"1","key":"10.1016\/j.ipl.2017.12.009_br0050","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1002\/net.20345","article-title":"Wavelength assignment in multifiber star networks","volume":"56","author":"Bian","year":"2010","journal-title":"Networks"},{"key":"10.1016\/j.ipl.2017.12.009_br0060","series-title":"ICALP 2003 Proc.","first-page":"410","article-title":"Multicommodity demand flow in a tree","volume":"vol. 2719","author":"Chekuri","year":"2003"},{"key":"10.1016\/j.ipl.2017.12.009_br0070","series-title":"ISAAC 1998 Proc.","first-page":"179","article-title":"Maximizing the number of connections in optical tree networks","volume":"vol. 1533","author":"Erlebach","year":"1998"},{"issue":"1\u20132","key":"10.1016\/j.ipl.2017.12.009_br0080","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","article-title":"The complexity of path coloring and call scheduling","volume":"255","author":"Erlebach","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2017.12.009_br0090","series-title":"WG 2003 Proc.","first-page":"218","article-title":"Resource allocation problems in multifiber WDM tree networks","volume":"vol. 2880","author":"Erlebach","year":"2003"},{"issue":"4","key":"10.1016\/j.ipl.2017.12.009_br0100","first-page":"345","article-title":"Using Euler partitions to edge color bipartite multigraphs","volume":"5","author":"Gabow","year":"1976","journal-title":"Int. J. Parallel Program."},{"issue":"1","key":"10.1016\/j.ipl.2017.12.009_br0110","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","article-title":"The edge intersection graphs of paths in a tree","volume":"38","author":"Golumbic","year":"1985","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"10.1016\/j.ipl.2017.12.009_br0120","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/90.909024","article-title":"On the wavelength assignment problem in multifiber WDM star and ring networks","volume":"9","author":"Li","year":"2001","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.ipl.2017.12.009_br0130","series-title":"ICALP 2000 Proc.","first-page":"768","article-title":"Wavelength assignment problem on all-optical networks with k fibres per link","volume":"vol. 1853","author":"Margara","year":"2000"},{"issue":"3","key":"10.1016\/j.ipl.2017.12.009_br0140","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1109\/31.1747","article-title":"On the f-coloring of multigraphs","volume":"35","author":"Nakano","year":"1988","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/j.ipl.2017.12.009_br0150","series-title":"Path Coloring in Graphs","author":"Nomikos","year":"1997"},{"key":"10.1016\/j.ipl.2017.12.009_br0160","series-title":"NETWORKING 2004 Proc.","first-page":"150","article-title":"Fiber cost reduction and wavelength minimization in multifiber WDM networks","volume":"vol. 3042","author":"Nomikos","year":"2004"},{"issue":"1","key":"10.1016\/j.ipl.2017.12.009_br0170","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comnet.2004.11.028","article-title":"Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost","volume":"50","author":"Nomikos","year":"2006","journal-title":"Comput. Netw."},{"issue":"5","key":"10.1016\/j.ipl.2017.12.009_br0180","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0020-0190(01)00167-3","article-title":"Routing and path multicoloring","volume":"80","author":"Nomikos","year":"2001","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.ipl.2017.12.009_br0190","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S1389-1286(02)00448-6","article-title":"Satisfying a maximum number of pre-routed requests in all-optical rings","volume":"42","author":"Nomikos","year":"2003","journal-title":"Comput. Netw."},{"issue":"3","key":"10.1016\/j.ipl.2017.12.009_br0200","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00607-007-0234-2","article-title":"Path multicoloring with fewer colors in spiders and caterpillars","volume":"80","author":"Pagourtzis","year":"2007","journal-title":"Computing"},{"key":"10.1016\/j.ipl.2017.12.009_br0210","series-title":"NETWORKING 2005 Proc.","first-page":"1465","article-title":"Maximizing the number of connections in multifiber WDM chain, ring and star networks","volume":"vol. 3462","author":"Potika","year":"2005"},{"key":"10.1016\/j.ipl.2017.12.009_br0220","series-title":"STOC 1994 Proc.","first-page":"134","article-title":"Efficient routing in all-optical networks","author":"Raghavan","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019018300012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019018300012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T07:43:25Z","timestamp":1719733405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019018300012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":22,"alternative-id":["S0020019018300012"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2017.12.009","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2018,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Path multicoloring in spider graphs with even color multiplicity","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2017.12.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}