{"id":"https://openalex.org/W4230126017","doi":"https://doi.org/10.1201/9781003068006-4","title":"Backtracking Algorithms","display_name":"Backtracking Algorithms","publication_year":2020,"publication_date":"2020-09-16","ids":{"openalex":"https://openalex.org/W4230126017","doi":"https://doi.org/10.1201/9781003068006-4"},"language":"en","primary_location":{"id":"doi:10.1201/9781003068006-4","doi":"https://doi.org/10.1201/9781003068006-4","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003068006-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306463075","display_name":"CRC Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320584","host_organization_name":"CRC Press","host_organization_lineage":["https://openalex.org/P4310320584","https://openalex.org/P4310320547"],"host_organization_lineage_names":["CRC Press","Taylor & Francis"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Algorithms","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4253780382","display_name":"Combinatorial Algorithms"},"type":"book-chapter","is_traditional":true,"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/A5024341118","display_name":"Donald L. Kreher","orcid":"https://orcid.org/0000-0002-5031-9410","observed_orcids":["https://orcid.org/0000-0002-5031-9410"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Donald L. Kreher","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021938024","display_name":"Douglas R. Stinson","orcid":"https://orcid.org/0000-0001-5635-8122","observed_orcids":["https://orcid.org/0000-0001-5635-8122"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Douglas R. Stinson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9276,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71722365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6646000146865845,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6646000146865845,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.23579999804496765,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.05169999971985817,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.9739999771118164},{"id":"https://openalex.org/keywords/pruning","display_name":"pruning","score":0.7950000166893005},{"id":"https://openalex.org/keywords/bounding-functions","display_name":"bounding functions","score":0.9929999709129333},{"id":"https://openalex.org/keywords/clique-search","display_name":"clique search","score":0.6449999809265137},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.972000002861023},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9150000214576721}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.8211871385574341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6429381370544434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48147526383399963}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781003068006-4","doi":"https://doi.org/10.1201/9781003068006-4","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003068006-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306463075","display_name":"CRC Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320584","host_organization_name":"CRC Press","host_organization_lineage":["https://openalex.org/P4310320584","https://openalex.org/P4310320547"],"host_organization_lineage_names":["CRC Press","Taylor & Francis"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Algorithms","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2291805666","https://openalex.org/W2071505884","https://openalex.org/W2106144871","https://openalex.org/W2389862427","https://openalex.org/W7096171003","https://openalex.org/W2079310906","https://openalex.org/W2005234139","https://openalex.org/W2372579033","https://openalex.org/W6960009439","https://openalex.org/W7098877258"],"abstract_inverted_index":{"A":[0,80],"backtracking":[1,60],"algorithm":[2],"is":[3,63,86,118],"a":[4,13,20,54,59,65,72,89,97,110],"recursive":[5],"method":[6,46,67,83],"of":[7,51,84,115],"building":[8],"up":[9],"feasible":[10],"solutions":[11],"to":[12,29,47,68,78,87],"combinatorial":[14,23],"optimization":[15],"problem":[16],"one":[17],"step":[18],"at":[19],"time.":[21],"Many":[22],"search":[24,75],"problems":[25],"can":[26],"be":[27],"reduced":[28],"finding":[30],"(maximal)":[31],"cliques":[32],"in":[33,53,108],"an":[34,44],"appropriately":[35],"chosen":[36],"graph.":[37],"In":[38,92],"this":[39],"chapter,":[40],"the":[41,49,93,113,116],"authors":[42],"present":[43],"algorithmic":[45],"estimate":[48],"number":[50],"nodes":[52],"state":[55],"space":[56],"tree":[57],"for":[58],"algorithm.":[61],"It":[62],"therefore":[64],"useful":[66],"predict":[69],"how":[70],"long":[71],"big":[73],"backtrack":[74],"might":[76],"take":[77],"finish.":[79],"more":[81],"sophisticated":[82],"pruning":[85],"use":[88],"bounding":[90],"function.":[91],"traveling":[94],"salesman":[95,98],"problem,":[96],"must":[99],"visit":[100],"n":[101],"cities":[102],"and":[103],"return":[104],"home,":[105],"doing":[106],"so":[107],"such":[109],"way":[111],"that":[112],"cost":[114],"trip":[117],"minimized.":[119]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2022-05-11T00:00:00"}