{"id":"https://openalex.org/W2577960842","doi":"https://doi.org/10.1090/dimacs/035/03","title":"Backtracking and probing","display_name":"Backtracking and probing","publication_year":1997,"publication_date":"1997-12-09","ids":{"openalex":"https://openalex.org/W2577960842","doi":"https://doi.org/10.1090/dimacs/035/03","mag":"2577960842"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/035/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5030220389","display_name":"Paul W. Purdom","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul Purdom","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056338565","display_name":"G. Neil Haven","orcid":null},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"G Haven","raw_affiliation_strings":["University of Calgary, Calgary, AB, Canada"],"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, AB, Canada","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030220389"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8422,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.95,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12034","display_name":"Digital and Cyber Forensics","score":0.006000000052154064,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12034","display_name":"Digital and Cyber Forensics","score":0.006000000052154064,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T13523","display_name":"Mathematics, Computing, and Information Processing","score":0.005499999970197678,"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/T14380","display_name":"Libraries and Information Services","score":0.005400000140070915,"subfield":{"id":"https://openalex.org/subfields/1209","display_name":"Museology"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.9016716480255127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5277108550071716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20448121428489685}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9016716480255127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5277108550071716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20448121428489685}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/035/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.7153","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.7153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.indiana.edu/pub/techreports/TR387.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.1160","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.indiana.edu/l/www/ftp/techreports/TR387.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":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W1631221657","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W1525406239","https://openalex.org/W2371864976"],"abstract_inverted_index":{":":[0],"We":[1],"analyze":[2],"two":[3],"algorithms":[4],"for":[5,29,54,149],"solving":[6],"constraint":[7,59],"satisfaction":[8,60],"problems.":[9],"One":[10],"of":[11,83],"these":[12],"algorithms,":[13],"Probe":[14,35,150],"Order":[15,36,151],"Backtracking,":[16],"has":[17],"an":[18,95],"average":[19,147],"running":[20],"time":[21,148],"much":[22],"faster":[23],"than":[24],"any":[25],"previously":[26],"analyzed":[27],"algorithm":[28,80],"problems":[30,130],"where":[31],"solutions":[32],"are":[33,72],"common.":[34],"Backtracking":[37,152],"uses":[38],"a":[39,55,58,140,144],"probing":[40,77,88],"assignment":[41,45,89],"(a":[42],"preselected":[43],"test":[44],"to":[46,49,57,75,91],"unset":[47,70,96],"variables)":[48],"help":[50],"guide":[51],"the":[52,63,69,76,79,84,87,111,123,146],"search":[53],"solution":[56],"problem.":[61],"If":[62],"problem":[64],"is":[65,153],"not":[66],"satisfied":[67],"when":[68],"variables":[71],"temporarily":[73],"set":[74],"assignment,":[78],"selects":[81,94],"one":[82],"relations":[85],"that":[86,99,139],"fails":[90],"satisfy":[92],"and":[93,121,136],"variable":[97,113],"from":[98],"relation.":[100],"Then":[101],"at":[102],"each":[103,114,119],"backtracking":[104],"step":[105],"it":[106],"generates":[107],"subproblems":[108],"by":[109],"setting":[110],"selected":[112],"possible":[115],"way.":[116],"It":[117],"simplifies":[118],"subproblem,":[120],"tries":[122],"same":[124],"technique":[125],"on":[126],"them.":[127],"For":[128],"random":[129],"with":[131],"v":[132],"variables,":[133],"t":[134],"clauses,":[135],"probability":[137],"p":[138],"literal":[141],"appears":[142],"in":[143],"clause,":[145],"no":[154],"m...":[155]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}