{"id":"https://openalex.org/W2008080405","doi":"https://doi.org/10.1016/0020-0190(94)90128-7","title":"An efficient transitive closure algorithm for cyclic digraphs","display_name":"An efficient transitive closure algorithm for cyclic digraphs","publication_year":1994,"publication_date":"1994-11-01","ids":{"openalex":"https://openalex.org/W2008080405","doi":"https://doi.org/10.1016/0020-0190(94)90128-7","mag":"2008080405"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)90128-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90128-7","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/A5001691319","display_name":"Esko Nuutila","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Esko Nuutila","raw_affiliation_strings":["Laboratory of Information Processing Science, Helsinki University of Technology, Otakaari 1, FIN-02150 Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Laboratory of Information Processing Science, Helsinki University of Technology, Otakaari 1, FIN-02150 Espoo, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001691319"],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.1285095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"52","issue":"4","first_page":"207","last_page":"213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9886000156402588,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9886000156402588,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9818999767303467,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9789999723434448,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.983240008354187},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.903793454170227},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.7502362132072449},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.710587739944458},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6778389811515808},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6212447285652161},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5079718232154846},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.47705498337745667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4592769742012024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42880910634994507},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2728075087070465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24048393964767456},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07239881157875061},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06601336598396301}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.983240008354187},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.903793454170227},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.7502362132072449},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.710587739944458},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6778389811515808},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6212447285652161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5079718232154846},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.47705498337745667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4592769742012024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42880910634994507},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2728075087070465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24048393964767456},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07239881157875061},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06601336598396301},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(94)90128-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90128-7","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.5639","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.5639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://stg.cs.hut.fi/publications/nuutila-94.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W198808598","https://openalex.org/W1965253335","https://openalex.org/W1972316579","https://openalex.org/W2047783181","https://openalex.org/W2070992781","https://openalex.org/W2084063516","https://openalex.org/W2099624270","https://openalex.org/W2109767783","https://openalex.org/W2118382442","https://openalex.org/W2905110430"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2362009423","https://openalex.org/W2136009070","https://openalex.org/W2371151875","https://openalex.org/W2383282217","https://openalex.org/W1994877243","https://openalex.org/W2012063573","https://openalex.org/W1996983051","https://openalex.org/W2349651113","https://openalex.org/W1499233953"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}