{"id":"https://openalex.org/W2007700615","doi":"https://doi.org/10.1016/0167-8655(91)90307-8","title":"An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs","display_name":"An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs","publication_year":1991,"publication_date":"1991-07-01","ids":{"openalex":"https://openalex.org/W2007700615","doi":"https://doi.org/10.1016/0167-8655(91)90307-8","mag":"2007700615"},"language":"en","primary_location":{"id":"doi:10.1016/0167-8655(91)90307-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8655(91)90307-8","pdf_url":null,"source":{"id":"https://openalex.org/S151820558","display_name":"Pattern Recognition Letters","issn_l":"0167-8655","issn":["0167-8655","1872-7344"],"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":"Pattern Recognition 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/A5111872056","display_name":"Prabir Bhattacharya","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Prabir Bhattacharya","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, USA","Department of Computer Science and Engineering, University of Nebraska \u2013 Lincoln, Lincoln, NE 68588, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska \u2013 Lincoln, Lincoln, NE 68588, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038368569","display_name":"Francis Suraweera","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francis Suraweera","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, USA","Department of Computer Science and Engineering, University of Nebraska \u2013 Lincoln, Lincoln, NE 68588, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska \u2013 Lincoln, Lincoln, NE 68588, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111872056"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":{"value":2500,"currency":"USD","value_usd":2500},"apc_paid":null,"fwci":1.0227,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.73570246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"7","first_page":"413","last_page":"420"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9930999875068665,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9930999875068665,"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/T11106","display_name":"Data Management and Algorithms","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11671","display_name":"Fuzzy and Soft Set Theory","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.8277558088302612},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.7797910571098328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6989087462425232},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6440687775611877},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.582779049873352},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5151178240776062},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5057566165924072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4389124810695648}],"concepts":[{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.8277558088302612},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.7797910571098328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6989087462425232},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6440687775611877},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.582779049873352},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5151178240776062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5057566165924072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4389124810695648},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-8655(91)90307-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8655(91)90307-8","pdf_url":null,"source":{"id":"https://openalex.org/S151820558","display_name":"Pattern Recognition Letters","issn_l":"0167-8655","issn":["0167-8655","1872-7344"],"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":"Pattern Recognition Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W172770676","https://openalex.org/W1481886395","https://openalex.org/W1496156369","https://openalex.org/W1521534991","https://openalex.org/W1623080549","https://openalex.org/W1979622972","https://openalex.org/W2011039300","https://openalex.org/W2013575195","https://openalex.org/W2019529630","https://openalex.org/W2028649872","https://openalex.org/W2048819046","https://openalex.org/W2066909688","https://openalex.org/W2076190479","https://openalex.org/W2104734478","https://openalex.org/W2113076747","https://openalex.org/W2150738959","https://openalex.org/W2753176400","https://openalex.org/W2986989272","https://openalex.org/W3147056755","https://openalex.org/W4211007335","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W2953175190","https://openalex.org/W2364423979","https://openalex.org/W4366733366","https://openalex.org/W3137798114","https://openalex.org/W4378087371","https://openalex.org/W2998748068","https://openalex.org/W2364608040","https://openalex.org/W1983442375","https://openalex.org/W3190844188","https://openalex.org/W4387398410"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}