{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T06:48:20Z","timestamp":1697611700692},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00197-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:51:20Z","timestamp":1027612280000},"page":"257-266","source":"Crossref","is-referenced-by-count":1,"title":["Wide-diameter and minimum length of fan"],"prefix":"10.1016","volume":"235","author":[{"given":"Toru","family":"Kojima","sequence":"first","affiliation":[]},{"given":"Kiyoshi","family":"Ando","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00197-8_BIB1","unstructured":"R.J. Faudree, Some strong variations of connectivity, Combinatorics, Paul Erd\u0151s is eighty, Vol. 1, Bolyai Soc. Math. Stud., J\u00e1nos Bolyai Math. Soc., Budapest, 1993, pp. 125\u2013144"},{"key":"10.1016\/S0304-3975(99)00197-8_BIB2","first-page":"668","article-title":"On container width and length in graphs, groups, and networks","volume":"E77-A","author":"Hsu","year":"1994","journal-title":"IEICE Trans. Fundam."},{"key":"10.1016\/S0304-3975(99)00197-8_BIB3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen Kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fundam. Math."},{"key":"10.1016\/S0304-3975(99)00197-8_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","article-title":"Efficient dispersal of information for security, load balancing, and fault tolerance","volume":"36","author":"Rabin","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(99)00197-8_BIB5","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"M.H. Schultz, Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001978?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001978?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T18:22:14Z","timestamp":1556302934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397599001978"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00197-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}