{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:50:46Z","timestamp":1649173846061},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,30]],"date-time":"2010-04-30T00:00:00Z","timestamp":1272585600000},"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":[[2011,10]]},"DOI":"10.1007\/s10878-010-9325-7","type":"journal-article","created":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T20:37:09Z","timestamp":1272573429000},"page":"469-481","source":"Crossref","is-referenced-by-count":0,"title":["Sublinear-time algorithms for tournament graphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[]},{"given":"Tom","family":"Friedetzky","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Nagel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,30]]},"reference":[{"key":"9325_CR1","first-page":"2151","volume":"249","author":"P Camion","year":"1959","unstructured":"Camion P (1959) Chemins et circuits hamiltoniens dans les graphes complets. C R Acad Sci Paris 249:2151\u20132152","journal-title":"C R Acad Sci Paris"},{"key":"9325_CR2","first-page":"23","volume":"89","author":"A Czumaj","year":"2006","unstructured":"Czumaj A, Sohler C (2006) Sublinear-time algorithms. Bull Eur Assoc Theor Comput Sci 89:23\u201347","journal-title":"Bull Eur Assoc Theor Comput Sci"},{"key":"9325_CR3","volume-title":"Topics on tournaments","author":"JW Moon","year":"1968","unstructured":"Moon JW (1968) Topics on tournaments. Holt, Rinehart, and Winston, New York"},{"key":"9325_CR4","first-page":"169","volume-title":"Selected topics in graph theory","author":"KB Reid","year":"1978","unstructured":"Reid KB, Beineke LW (1978) Tournaments. In: Beineke LW, Wilson RJ (eds) Selected topics in graph theory. Academic Press, San Diego, pp 169\u2013204"},{"key":"9325_CR5","unstructured":"Rubinfeld R (2006) Sublinear time algorithms. Available at http:\/\/people.csail.mit.edu\/ronitt\/pa-pers\/index.html"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9325-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9325-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9325-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9325-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,30]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9325"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9325-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,30]]}}}