{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T07:16:22Z","timestamp":1781766982491,"version":"3.54.5"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(01)00197-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:52:51Z","timestamp":1027583571000},"page":"87-98","source":"Crossref","is-referenced-by-count":6,"title":["Antidirected hamiltonian paths between specified vertices of a tournament"],"prefix":"10.1016","volume":"117","author":[{"given":"P.","family":"Hell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Rosenfeld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00197-4_BIB1","series-title":"Lecture Notes in Computer Science, vol. 1120, Combinatorics and Computer Science","first-page":"67","article-title":"Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament","author":"Bampis","year":"1996"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB2","doi-asserted-by":"crossref","unstructured":"E. Bampis, I. Milis, Y. Manoussakis, NC algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments, in E.W. Mayr et al. (Eds.), Lecture Notes in Computer Science, vol. 903, Graph Theoretic Concepts in Computer Science WG\u201994, Springer, Berlin, pp. 387\u2013394.","DOI":"10.1007\/3-540-59071-4_63"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0196-6774(92)90008-Z","article-title":"A polynomial algorithm for Hamilton connectedness in semicomplete digraphs","volume":"13","author":"Bang-Jensen","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0095-8956(71)90035-9","article-title":"Antidirected Hamiltonian paths in tournaments","volume":"11","author":"Gr\u00fcnbaum","year":"1971","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1006\/jctb.1999.1945","article-title":"Oriented hamiltonian paths in tournaments: a proof of Rosenfeld's conjecture","volume":"78","author":"Havet","year":"2000","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0196-6774(83)90011-1","article-title":"The complexity of finding generalized paths in tournaments","volume":"4","author":"Hell","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB7","series-title":"Topics on Tournaments","author":"Moon","year":"1969"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB8","unstructured":"V. Petrovic, Antidirected Hamiltonian circuits in tournaments, in: Proceedings of the Fourth Yugoslav Seminar of Graph Theory, Novi Sad, 1983, pp. 259\u2013269."},{"key":"10.1016\/S0166-218X(01)00197-4_BIB9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0095-8956(72)90035-4","article-title":"Antidirected Hamiltonian paths in tournaments","volume":"12","author":"Rosenfeld","year":"1972","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB10","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0095-8956(74)90069-0","article-title":"Antidirected Hamiltonian circuits in tournaments","volume":"16","author":"Rosenfeld","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB11","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0196-6774(88)90042-9","article-title":"Fast parallel algorithms for finding Hamilton paths and cycles in tournaments","volume":"9","author":"Soroker","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00197-4_BIB12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9947-1986-0837805-6","article-title":"Paths and cycles in tournaments","volume":"296","author":"Thomason","year":"1986","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(01)00197-4_BIB13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01427945","article-title":"Antidirected Hamiltonian circuits and paths in tournaments","volume":"201","author":"Thomassen","year":"1973","journal-title":"Math. Ann."},{"key":"10.1016\/S0166-218X(01)00197-4_BIB14","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0095-8956(80)90061-1","article-title":"Hamiltonian-connected tournaments","volume":"28","author":"Thomassen","year":"1980","journal-title":"J. Combin. Theory B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001974?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001974?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:51:02Z","timestamp":1557100262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X01001974"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00197-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}