{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:23:39Z","timestamp":1775838219281,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":9024,"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":[[1988,11]]},"DOI":"10.1016\/0304-3975(88)90131-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"307-316","source":"Crossref","is-referenced-by-count":40,"title":["On finding a minimum dominating set in a tournament"],"prefix":"10.1016","volume":"61","author":[{"given":"Nimrod","family":"Megiddo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90131-4_BIB1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.2307\/3613396","article-title":"On a problem in graph theory","volume":"47","author":"Erd\u00f6s","year":"1963","journal-title":"Math. Gaz."},{"key":"10.1016\/0304-3975(88)90131-4_BIB2","series-title":"Computers and Intractability: a Guide to the Theory of NP completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(88)90131-4_BIB3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","article-title":"A constructive solution to a tournament problem","volume":"14","author":"Graham","year":"1971","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0304-3975(88)90131-4_BIB4","series-title":"The Distribution of Prime Numbers","author":"Huxley","year":"1972"},{"key":"10.1016\/0304-3975(88)90131-4_BIB5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/0209003","article-title":"Refining nondeterminism in relativized polynomial-time bounded computations","volume":"9","author":"Kintala","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90131-4_BIB6","series-title":"Topics on Tournaments","author":"Moon","year":"1968"},{"key":"10.1016\/0304-3975(88)90131-4_BIB7","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","article-title":"Finding a maximum independent set","volume":"6","author":"Tarjan","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:38Z","timestamp":1555127678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0304397588901314"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90131-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}