{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:35:18Z","timestamp":1649097318856},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-013-9697-6","type":"journal-article","created":{"date-parts":[[2014,1,6]],"date-time":"2014-01-06T22:57:58Z","timestamp":1389049078000},"page":"1196-1218","source":"Crossref","is-referenced-by-count":0,"title":["The minimum number of hubs in networks"],"prefix":"10.1007","volume":"30","author":[{"given":"Easton Li","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangyue","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"9697_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B (1998) Modern graph theory. Springer, New York"},{"key":"9697_CR2","doi-asserted-by":"crossref","unstructured":"Han G (2009) Menger\u2019s paths with minimum mergings. In: Proc. 2009 IEEE inform. theory workshop on netw. and Inform. theory, pp 271\u2013275","DOI":"10.1109\/ITWNIT.2009.5158585"},{"issue":"6","key":"9697_CR3","doi-asserted-by":"crossref","first-page":"2386","DOI":"10.1109\/TIT.2006.874434","volume":"52","author":"M Langberg","year":"2006","unstructured":"Langberg M, Sprintson A, Bruck J (2006) The encoding complexity of network coding. IEEE Trans Inf Theory 52(6):2386\u20132397","journal-title":"IEEE Trans Inf Theory"},{"key":"9697_CR4","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger K (1927) Zur allgemeinen Kurventhoerie. Fundam Math 10:96\u2013115","journal-title":"Fundam Math"},{"key":"9697_CR5","unstructured":"Xu EL, Shang W, Han G (2012) A graph theoretical approach to network encoding complexity. In: Proc. 2012 int. symp. on inform. theory and its appl., pp 396\u2013400"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9697-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9697-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9697-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T18:45:54Z","timestamp":1565030754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9697-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9697"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9697-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,8]]}}}