{"id":"https://openalex.org/W2014355235","doi":"https://doi.org/10.1016/0004-3702(71)90006-3","title":"An admissible and optimal algorithm for searching AND/OR graphs","display_name":"An admissible and optimal algorithm for searching AND/OR graphs","publication_year":1971,"publication_date":"1971-01-01","ids":{"openalex":"https://openalex.org/W2014355235","doi":"https://doi.org/10.1016/0004-3702(71)90006-3","mag":"2014355235"},"language":"en","primary_location":{"id":"doi:10.1016/0004-3702(71)90006-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(71)90006-3","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","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/A5108479520","display_name":"C. L. Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I1299303238","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88","country_code":"US","type":"government","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C.L. Chang","raw_affiliation_strings":["Heuristics Laboratory, Division of Computer Research and Technology, Bethesda, Maryland 20014, USA","National Institutes of Health, Department of Health, Education and Welfare, Bethesda, Maryland 20014, USA"],"affiliations":[{"raw_affiliation_string":"Heuristics Laboratory, Division of Computer Research and Technology, Bethesda, Maryland 20014, USA","institution_ids":[]},{"raw_affiliation_string":"National Institutes of Health, Department of Health, Education and Welfare, Bethesda, Maryland 20014, USA","institution_ids":["https://openalex.org/I1299303238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111400427","display_name":"James R. Slagle","orcid":null},"institutions":[{"id":"https://openalex.org/I1299303238","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88","country_code":"US","type":"government","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.R. Slagle","raw_affiliation_strings":["Heuristics Laboratory, Division of Computer Research and Technology, Bethesda, Maryland 20014, USA","National Institutes of Health, Department of Health, Education and Welfare, Bethesda, Maryland 20014, USA"],"affiliations":[{"raw_affiliation_string":"Heuristics Laboratory, Division of Computer Research and Technology, Bethesda, Maryland 20014, USA","institution_ids":[]},{"raw_affiliation_string":"National Institutes of Health, Department of Health, Education and Welfare, Bethesda, Maryland 20014, USA","institution_ids":["https://openalex.org/I1299303238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108479520"],"corresponding_institution_ids":["https://openalex.org/I1299303238"],"apc_list":{"value":3670,"currency":"USD","value_usd":3670},"apc_paid":null,"fwci":11.292,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.97615894,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":"2","first_page":"117","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9970999956130981,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9970999956130981,"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/T10142","display_name":"Formal Methods in Verification","score":0.9932000041007996,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9930999875068665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.6240964531898499},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.5946105718612671},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.5871034860610962},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.57705157995224},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.5648508667945862},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5010788440704346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49703577160835266},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.486606240272522},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.46993619203567505},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4687977433204651},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.4686557352542877},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4274289309978485},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.4238797426223755},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41543978452682495},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3667640686035156},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17966139316558838}],"concepts":[{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.6240964531898499},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.5946105718612671},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.5871034860610962},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.57705157995224},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.5648508667945862},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5010788440704346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49703577160835266},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.486606240272522},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.46993619203567505},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4687977433204651},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.4686557352542877},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4274289309978485},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4238797426223755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41543978452682495},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3667640686035156},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17966139316558838}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0004-3702(71)90006-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(71)90006-3","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309210","display_name":"U.S. Department of Health, Education and Welfare","ror":"https://ror.org/033jnv181"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W154400549","https://openalex.org/W218978522","https://openalex.org/W608171497","https://openalex.org/W1548095335","https://openalex.org/W1854374749","https://openalex.org/W1969483458","https://openalex.org/W2032476237","https://openalex.org/W2052628540","https://openalex.org/W2062022502","https://openalex.org/W2100952354","https://openalex.org/W2108424472","https://openalex.org/W2126677653","https://openalex.org/W2139090598","https://openalex.org/W2160645305","https://openalex.org/W2161608691","https://openalex.org/W3198350258","https://openalex.org/W6606277319","https://openalex.org/W6608692173","https://openalex.org/W6639099303"],"related_works":["https://openalex.org/W2953496651","https://openalex.org/W2393701947","https://openalex.org/W3208942821","https://openalex.org/W2886672068","https://openalex.org/W2542507283","https://openalex.org/W2562224395","https://openalex.org/W2014355235","https://openalex.org/W2335877399","https://openalex.org/W2381307763","https://openalex.org/W2793949464"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}