{"id":"https://openalex.org/W2066708286","doi":"https://doi.org/10.1016/0196-6774(88)90042-9","title":"Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament","display_name":"Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W2066708286","doi":"https://doi.org/10.1016/0196-6774(88)90042-9","mag":"2066708286"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(88)90042-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(88)90042-9","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109345970","display_name":"Danny Soroker","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Danny Soroker","raw_affiliation_strings":["Computer Science Division, 570 Evans Hall, University of California, Berkeley, California 94720 USA","University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"Computer Science Division, 570 Evans Hall, University of California, Berkeley, California 94720 USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109345970"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":2.1407,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.87275495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"9","issue":"2","first_page":"276","last_page":"286"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.968500018119812,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.9835596084594727},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8782874345779419},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.7218914031982422},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7035844326019287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6835905313491821},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6344610452651978},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.628055214881897},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4846670925617218},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47019943594932556},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4517499804496765},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44853854179382324},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3356495499610901},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32201486825942993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2273237407207489},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10344627499580383},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08665916323661804}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9835596084594727},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8782874345779419},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.7218914031982422},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7035844326019287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6835905313491821},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6344610452651978},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.628055214881897},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4846670925617218},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47019943594932556},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4517499804496765},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44853854179382324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3356495499610901},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32201486825942993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2273237407207489},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10344627499580383},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08665916323661804},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0196-6774(88)90042-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(88)90042-9","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:berkeley.edu:13030-hb9290117g","is_oa":false,"landing_page_url":"http://techreports.lib.berkeley.edu/accessPages/CSD-87-309.html","pdf_url":null,"source":{"id":"https://openalex.org/S7407050879","display_name":"UC Berkeley","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"technical reports"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W161902538","https://openalex.org/W356477583","https://openalex.org/W2035476608","https://openalex.org/W2911265074"],"related_works":["https://openalex.org/W4300961889","https://openalex.org/W2001055462","https://openalex.org/W1982396410","https://openalex.org/W2056414620","https://openalex.org/W2389785861","https://openalex.org/W2558610248","https://openalex.org/W2066708286","https://openalex.org/W2185406059","https://openalex.org/W1991927950","https://openalex.org/W2962785705"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}