{"id":"https://openalex.org/W2075704325","doi":"https://doi.org/10.1016/s0020-0190(01)00245-9","title":"Algorithms for transitive closure","display_name":"Algorithms for transitive closure","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W2075704325","doi":"https://doi.org/10.1016/s0020-0190(01)00245-9","mag":"2075704325"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(01)00245-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00245-9","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/A5020899377","display_name":"Alena Koubkov\u00e1","orcid":"https://orcid.org/0000-0002-5159-772X"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"A. Koubkov\u00e1","raw_affiliation_strings":["Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m.\u00a025, 118\u00a000 Praha\u00a01, Czech Republic","Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 118 00 Praha 1, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m.\u00a025, 118\u00a000 Praha\u00a01, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 118 00 Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031559202","display_name":"V\u00e1c\u0142av Koubek","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"V. Koubek","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, and Institute of Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m.\u00a025, 118\u00a000 Praha\u00a01, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, and Institute of Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m.\u00a025, 118\u00a000 Praha\u00a01, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020899377"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.2314,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.56058848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"81","issue":"6","first_page":"289","last_page":"296"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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.9987000226974487,"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.9957000017166138,"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.9822149276733398},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.971666693687439},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.8062648773193359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6590527296066284},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.643683671951294},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6186231374740601},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5770519971847534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5024359226226807},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4748166799545288},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.41239750385284424},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39514192938804626},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3264421224594116},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1834867298603058},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1261989176273346},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.0879102349281311}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9822149276733398},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.971666693687439},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.8062648773193359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6590527296066284},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.643683671951294},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6186231374740601},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5770519971847534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5024359226226807},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4748166799545288},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.41239750385284424},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39514192938804626},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3264421224594116},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1834867298603058},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1261989176273346},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0879102349281311},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(01)00245-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00245-9","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":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321005","display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","ror":"https://ror.org/037n8p820"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1513610428","https://openalex.org/W1544789779","https://openalex.org/W1655990431","https://openalex.org/W1994373792","https://openalex.org/W2017139167","https://openalex.org/W2118382442","https://openalex.org/W2545919726","https://openalex.org/W6630839173","https://openalex.org/W6729749364"],"related_works":["https://openalex.org/W3139713485","https://openalex.org/W1578808377","https://openalex.org/W2021661549","https://openalex.org/W4247505235","https://openalex.org/W2171308818","https://openalex.org/W1690273063","https://openalex.org/W2069149254","https://openalex.org/W189043490","https://openalex.org/W1990976277","https://openalex.org/W1997898455"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}