{"id":"https://openalex.org/W2105806022","doi":"https://doi.org/10.1002/rsa.3240050303","title":"Finding hidden hamiltonian cycles","display_name":"Finding hidden hamiltonian cycles","publication_year":1994,"publication_date":"1994-07-01","ids":{"openalex":"https://openalex.org/W2105806022","doi":"https://doi.org/10.1002/rsa.3240050303","mag":"2105806022"},"language":"en","primary_location":{"id":"doi:10.1002/rsa.3240050303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240050303","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & 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/A5108541542","display_name":"Andrei Broder","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrei Z. Broder","raw_affiliation_strings":["DEC Systems Research Center, 130 Lytton Avenue, Palo Alto, CA"],"affiliations":[{"raw_affiliation_string":"DEC Systems Research Center, 130 Lytton Avenue, Palo Alto, CA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan M. Frieze","raw_affiliation_strings":["A portion of this work was done while the author was visiting DECC SRC","Department of Mathematics, Carnegie-Mellon University"],"affiliations":[{"raw_affiliation_string":"A portion of this work was done while the author was visiting DECC SRC","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics, Carnegie-Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110128504","display_name":"Eli Shamir","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eli Shamir","raw_affiliation_strings":["A portion of this work was done while the author was visiting DEC SRC","The Institute of Mathematics and Computer Science, Hebrew University Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"A portion of this work was done while the author was visiting DEC SRC","institution_ids":[]},{"raw_affiliation_string":"The Institute of Mathematics and Computer Science, Hebrew University Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108541542"],"corresponding_institution_ids":[],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":0.5648,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.76373933,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"5","issue":"3","first_page":"395","last_page":"410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8614561557769775},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6965289115905762},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5837519764900208},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5775823593139648},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49690869450569153},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44346532225608826},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41858968138694763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37509825825691223},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09408852458000183}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8614561557769775},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6965289115905762},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5837519764900208},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5775823593139648},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49690869450569153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44346532225608826},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41858968138694763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37509825825691223},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09408852458000183}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/rsa.3240050303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240050303","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.1661","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.1661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.digital.fr/pub/DEC/SRC/publications/broder/cycles.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.7548","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.7548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.digital.com/pub/DEC/SRC/publications/broder/cycles.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.3515","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.3515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/Texfiles/hidden.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1989042829","https://openalex.org/W2009232680","https://openalex.org/W2012473793","https://openalex.org/W2016776056","https://openalex.org/W2017777628","https://openalex.org/W2030470615","https://openalex.org/W2030689634","https://openalex.org/W2061496873","https://openalex.org/W2063112592","https://openalex.org/W2071896207","https://openalex.org/W2100057426","https://openalex.org/W2126641717","https://openalex.org/W2136219960","https://openalex.org/W2141003493","https://openalex.org/W2952923218","https://openalex.org/W3104952918"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W2587900963","https://openalex.org/W1553466895"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"a":[2,8,35,75,95],"random":[3,17],"graph":[4],"G":[5,39,73],"composed":[6],"of":[7,65,72,77,89],"Hamiltonian":[9],"cycle":[10,37,97],"on":[11],"n":[12,46,49],"labeled":[13],"vertices":[14],"and":[15,56],"dn":[16],"edges":[18],"that":[19,30,58],"\u201chigh\u201d":[20],"the":[21,28,69,82,99],"cycle.":[22],"Is":[23],"it":[24,59],"possible":[25],"to":[26,32,85,94],"unravel":[27],"structures,":[29],"is,":[31],"efficiently":[33],"find":[34],"Himiltonian":[36],"in":[38],"?":[40],"We":[41],"describe":[42],"an":[43],"O":[44],"(":[45],"3":[47],"log":[48],")\u2010step":[50],"algorithm":[51],"A":[52,66,90],"for":[53,106],"this":[54,92],"purpose,":[55],"prove":[57],"succeeds":[60],"almost":[61],"surely.":[62],"Part":[63,87],"one":[64],"properly":[67],"covers":[68],"\u201ctrouble":[70],"spots\u201d":[71],"by":[74,98],"collection":[76],"disjoint":[78],"paths.":[79],"(This":[80],"is":[81,103],"hard":[83],"part":[84],"analyze).":[86],"two":[88],"extends":[91],"cover":[93],"full":[96],"rotation\u2010extension":[100],"technique":[101],"which":[102],"already":[104],"classical":[105],"such":[107],"problems.":[108],"\u00a9":[109],"1994":[110],"John":[111],"Wiley":[112],"&":[113],"Sons,":[114],"Inc.":[115]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}