{"id":"https://openalex.org/W2054900049","doi":"https://doi.org/10.1016/0020-0190(96)00123-8","title":"Algorithms for parsimonious complete sets in directed graphs","display_name":"Algorithms for parsimonious complete sets in directed graphs","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2054900049","doi":"https://doi.org/10.1016/0020-0190(96)00123-8","mag":"2054900049"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(96)00123-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00123-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5039842680","display_name":"Avraham A. Melkman","orcid":"https://orcid.org/0000-0002-6832-0102"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Avraham A. Melkman","raw_affiliation_strings":["Department of Mathematics and Computer Science, Ben Gurion University of the Negev, 84105 Beer-Sheva, Israel","Department of Mathematics and Computer Science, Ben Gurion University of the Negev. 84105 Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Ben Gurion University of the Negev, 84105 Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Ben Gurion University of the Negev. 84105 Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019694415","display_name":"Solomon Eyal Shimony","orcid":"https://orcid.org/0000-0001-6204-9166"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Solomon E. Shimony","raw_affiliation_strings":["Department of Mathematics and Computer Science, Ben Gurion University of the Negev, 84105 Beer-Sheva, Israel","Department of Mathematics and Computer Science, Ben Gurion University of the Negev. 84105 Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Ben Gurion University of the Negev, 84105 Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Ben Gurion University of the Negev. 84105 Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039842680"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":1.1316,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.81619647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"6","first_page":"335","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.992900013923645,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9922999739646912,"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/combinatorics","display_name":"Combinatorics","score":0.7506421804428101},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6434909701347351},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6206705570220947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6075888276100159},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.571921169757843},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5645681023597717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5115581154823303},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.44930368661880493},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44178494811058044},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.43234214186668396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3896873891353607},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3653343915939331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25687113404273987}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7506421804428101},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6434909701347351},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6206705570220947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6075888276100159},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.571921169757843},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5645681023597717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5115581154823303},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.44930368661880493},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44178494811058044},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.43234214186668396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3896873891353607},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3653343915939331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25687113404273987},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/0020-0190(96)00123-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00123-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W137603104","https://openalex.org/W1528945162","https://openalex.org/W1588648531","https://openalex.org/W2004848763","https://openalex.org/W2011992362","https://openalex.org/W2035955796","https://openalex.org/W2035967924","https://openalex.org/W2037481186","https://openalex.org/W2053307880","https://openalex.org/W2113634327","https://openalex.org/W2120959311","https://openalex.org/W2124301168","https://openalex.org/W2159080219","https://openalex.org/W6605003669","https://openalex.org/W6605584974","https://openalex.org/W6631862783","https://openalex.org/W6635235229","https://openalex.org/W6678197890"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403","https://openalex.org/W2783253555"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}