{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:13Z","timestamp":1725663493467},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540568919"},{"type":"electronic","value":"9783540477792"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56891-3_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:50:02Z","timestamp":1330239002000},"page":"553-560","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments"],"prefix":"10.1007","author":[{"given":"E.","family":"Bampis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"El Haddad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Manoussakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"issue":"No1","key":"44_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0403002","volume":"3","author":"A. Bar-Noy","year":"1990","unstructured":"A. Bar-Noy and J. Naor, Sorting, minimal feedback sets, and Hamiltonian paths in tournaments, SIAM J. Disc. Math Vol.3 No1 (1990), pp. 7\u201320.","journal-title":"SIAM J. Disc. Math"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. Brent","year":"1974","unstructured":"R. Brent, The parallel evaluation of general arithmetic expressions, J. ACM 21 (1974), pp. 201\u2013206.","journal-title":"J. ACM"},{"key":"44_CR3","first-page":"2151","volume":"249","author":"P. Camion","year":"1959","unstructured":"P. Camion, Chemins et circuits Hamiltoniens des graphes complets, C.R. Acad. Sci. Paris (A) 249 (1959), pp. 2151\u20132152.","journal-title":"C.R. Acad. Sci. Paris (A)"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1137\/0217009","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole and U. Vishkin, Approximate and exact parallel scheduling, part 1: the basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput. 17 (1988), pp. 128\u2013142.","journal-title":"SIAM J. Comput."},{"key":"44_CR5","unstructured":"A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0196-6774(83)90011-1","volume":"4","author":"P. Hell","year":"1982","unstructured":"P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, J. of Algorithms 4 (1982), pp. 303\u2013309.","journal-title":"J. of Algorithms"},{"key":"44_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(92)90233-Z","volume":"36","author":"Y. Manoussakis","year":"1992","unstructured":"Y. Manoussakis, A linear-time algorithm for finding Hamiltonians cycles in tournaments, Discrete Applied Mathematics 36 (1992), pp. 199\u2013201.","journal-title":"Discrete Applied Mathematics"},{"key":"44_CR8","unstructured":"L. Redei, Ein Kombinatorischer satz, Acta Litt. Sci. Szeged (1934), pp. 39\u201343."},{"key":"44_CR9","volume-title":"Ph.D Thesis, Rept UCB\/CSD87\/390","author":"D. Soroker","year":"1987","unstructured":"D. Soroker, Fast parallel algorithms for graphs and networks, Ph.D Thesis, Rept UCB\/CSD87\/390, Computer Science Division, university of California, Berkeley, CA (1987)."},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0196-6774(88)90042-9","volume":"9","author":"D. Soroker","year":"1988","unstructured":"D. Soroker, Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament, Journal of Algorithms 9 (1988), pp. 276\u2013286.","journal-title":"Journal of Algorithms"},{"key":"44_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","volume":"4","author":"U. Vishkin","year":"1983","unstructured":"U. Vishkin, Implementation of simultaneous memory address access in models that forbid it, J. Algorithms 4 (1983), pp. 45\u201350.","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","PARLE '93 Parallel Architectures and Languages Europe"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56891-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:33:57Z","timestamp":1558254837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56891-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540568919","9783540477792"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56891-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}