{"id":"https://openalex.org/W1974769464","doi":"https://doi.org/10.1016/0196-6774(88)90037-5","title":"An algorithm for finding hamilton cycles in random directed graphs","display_name":"An algorithm for finding hamilton cycles in random directed graphs","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W1974769464","doi":"https://doi.org/10.1016/0196-6774(88)90037-5","mag":"1974769464"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(88)90037-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(88)90037-5","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/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A.M Frieze","raw_affiliation_strings":["Department of Computer Science and Statistics, Queen Mary College, Mile End Road, London E1 4NS, England","Queen Mary Coll., London (UK)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Statistics, Queen Mary College, Mile End Road, London E1 4NS, England","institution_ids":["https://openalex.org/I166337079"]},{"raw_affiliation_string":"Queen Mary Coll., London (UK)","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056950019"],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":null,"apc_paid":null,"fwci":2.6505,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.89113459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"2","first_page":"181","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8854730725288391},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.837928295135498},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7615710496902466},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.7579898834228516},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7236498594284058},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6372421979904175},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6235073804855347},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5396283864974976},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5078521370887756},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45045194029808044},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4227803945541382},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38172855973243713},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2882956862449646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20394060015678406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09201163053512573}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8854730725288391},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.837928295135498},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7615710496902466},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.7579898834228516},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7236498594284058},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6372421979904175},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6235073804855347},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5396283864974976},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5078521370887756},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45045194029808044},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4227803945541382},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38172855973243713},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2882956862449646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20394060015678406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09201163053512573},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(88)90037-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(88)90037-5","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4699999988079071,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W169898132","https://openalex.org/W1602826012","https://openalex.org/W1655990431","https://openalex.org/W2008292658","https://openalex.org/W2008447568","https://openalex.org/W2019496833","https://openalex.org/W2021434280","https://openalex.org/W2061496873","https://openalex.org/W2062749672","https://openalex.org/W2063112592","https://openalex.org/W2085719367","https://openalex.org/W2103012681","https://openalex.org/W2905110430","https://openalex.org/W4238472918","https://openalex.org/W6652419135","https://openalex.org/W6824480957"],"related_works":["https://openalex.org/W2000334112","https://openalex.org/W2389785861","https://openalex.org/W1643271191","https://openalex.org/W2082494488","https://openalex.org/W2054349495","https://openalex.org/W2998116189","https://openalex.org/W2081358954","https://openalex.org/W2962785705","https://openalex.org/W2554461497","https://openalex.org/W2367252305"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}