{"id":"https://openalex.org/W2069038411","doi":"https://doi.org/10.1142/s1793830912500115","title":"AN ITERATIVE ALGORITHM OF COMPUTING THE TRANSITIVE CLOSURE OF A UNION OF PARAMETRIZED AFFINE INTEGER TUPLE RELATIONS","display_name":"AN ITERATIVE ALGORITHM OF COMPUTING THE TRANSITIVE CLOSURE OF A UNION OF PARAMETRIZED AFFINE INTEGER TUPLE RELATIONS","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2069038411","doi":"https://doi.org/10.1142/s1793830912500115","mag":"2069038411"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830912500115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500115","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5088179088","display_name":"W\u0142odzimierz Bielecki","orcid":"https://orcid.org/0000-0002-7943-6207"},"institutions":[{"id":"https://openalex.org/I104588304","display_name":"University of Szczecin","ror":"https://ror.org/05vmz5070","country_code":"PL","type":"education","lineage":["https://openalex.org/I104588304"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"WLODZIMIERZ BIELECKI","raw_affiliation_strings":["Technical University of Szczecin, ul. Zolnierska 49, Szczecin, Poland"],"affiliations":[{"raw_affiliation_string":"Technical University of Szczecin, ul. Zolnierska 49, Szczecin, Poland","institution_ids":["https://openalex.org/I104588304"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030718438","display_name":"Tomasz Klimek","orcid":null},"institutions":[{"id":"https://openalex.org/I104588304","display_name":"University of Szczecin","ror":"https://ror.org/05vmz5070","country_code":"PL","type":"education","lineage":["https://openalex.org/I104588304"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"TOMASZ KLIMEK","raw_affiliation_strings":["Technical University of Szczecin, ul. Zolnierska 49, Szczecin, Poland"],"affiliations":[{"raw_affiliation_string":"Technical University of Szczecin, ul. Zolnierska 49, Szczecin, Poland","institution_ids":["https://openalex.org/I104588304"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044868188","display_name":"Marek Pa\u0142kowski","orcid":"https://orcid.org/0000-0002-5932-4523"},"institutions":[{"id":"https://openalex.org/I104588304","display_name":"University of Szczecin","ror":"https://ror.org/05vmz5070","country_code":"PL","type":"education","lineage":["https://openalex.org/I104588304"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"MAREK PALKOWSKI","raw_affiliation_strings":["Technical University of Szczecin, ul. Zolnierska 49, Szczecin, Poland"],"affiliations":[{"raw_affiliation_string":"Technical University of Szczecin, ul. Zolnierska 49, Szczecin, Poland","institution_ids":["https://openalex.org/I104588304"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052782323","display_name":"Anna Beletska","orcid":null},"institutions":[{"id":"https://openalex.org/I4210126360","display_name":"Inria Saclay - \u00cele de France","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"ANNA BELETSKA","raw_affiliation_strings":["INRIA Saclay, Parc Club Universite, 3, rue J. Rostand, 91893 Orsay Cedex, France"],"affiliations":[{"raw_affiliation_string":"INRIA Saclay, Parc Club Universite, 3, rue J. Rostand, 91893 Orsay Cedex, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088179088"],"corresponding_institution_ids":["https://openalex.org/I104588304"],"apc_list":null,"apc_paid":null,"fwci":1.1251,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80047962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"04","issue":"01","first_page":"1250011","last_page":"1250011"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.21529999375343323,"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.21529999375343323,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.055799998342990875,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.04390000179409981,"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/transitive-closure","display_name":"Transitive closure","score":0.953149676322937},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.8459683656692505},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.799644947052002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7278987169265747},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6621500849723816},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.6502842307090759},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5983859896659851},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47204315662384033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4650040566921234},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4598222076892853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43301936984062195},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4087362587451935},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.358609676361084},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.17616498470306396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15467563271522522},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.0624505877494812},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.06026965379714966}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.953149676322937},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.8459683656692505},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.799644947052002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7278987169265747},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6621500849723816},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.6502842307090759},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5983859896659851},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47204315662384033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4650040566921234},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4598222076892853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43301936984062195},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4087362587451935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.358609676361084},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.17616498470306396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15467563271522522},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0624505877494812},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.06026965379714966},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830912500115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500115","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2062917934","https://openalex.org/W4238644074"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2362009423","https://openalex.org/W2371151875","https://openalex.org/W2383282217","https://openalex.org/W2136009070","https://openalex.org/W4230967508","https://openalex.org/W2012063573","https://openalex.org/W1499233953","https://openalex.org/W1994877243","https://openalex.org/W1996983051"],"abstract_inverted_index":{"A":[0],"novel":[1],"iterative":[2,82],"algorithm":[3,38,56,97],"of":[4,10,19,48,51,60,72,85,91,94,100],"calculating":[5],"the":[6,37,45,49,55,58,70,89,92,95],"exact":[7,34,66],"transitive":[8,35,46,67,74],"closure":[9,47],"a":[11,17],"parametrized":[12],"graph":[13],"being":[14],"represented":[15],"by":[16],"union":[18,50,71,79],"simple":[20,53,62],"affine":[21],"integer":[22],"tuple":[23],"relations":[24],"is":[25,29],"presented.":[26],"When":[27],"it":[28],"not":[30],"possible":[31],"to":[32],"calculate":[33,44],"closure,":[36,68],"produces":[39],"its":[40,65],"upper":[41],"bound.":[42],"To":[43],"all":[52],"relations,":[54,63],"recognizes":[57],"class":[59],"each":[61],"calculates":[64],"forms":[69],"calculated":[73],"closures,":[75],"and":[76,105],"applies":[77],"this":[78],"in":[80],"an":[81],"procedure.":[83],"Results":[84],"experiments":[86],"aimed":[87],"at":[88],"comparison":[90],"effectiveness":[93],"presented":[96],"with":[98],"those":[99],"related":[101],"ones":[102],"are":[103],"outlined":[104],"discussed.":[106]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-03T08:47:05.690250","created_date":"2025-10-10T00:00:00"}