{"id":"https://openalex.org/W1978268649","doi":"https://doi.org/10.1145/967900.968121","title":"A new algorithm for computing transitive closures","display_name":"A new algorithm for computing transitive closures","alternate_titles":[],"publication_year":2004,"publication_date":"2004-03-14","ids":{"openalex":"https://openalex.org/W1978268649","doi":"https://doi.org/10.1145/967900.968121","mag":"1978268649"},"language":"en","primary_location":{"id":"doi:10.1145/967900.968121","doi":"https://doi.org/10.1145/967900.968121","is_oa":false,"landing_page_url":"https://doi.org/10.1145/967900.968121","pdf_url":null,"source":{"id":"https://openalex.org/S4306417581","display_name":"ACM Symposium on Applied Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 ACM symposium on Applied computing","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W1978268649"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5115602977","display_name":"Yangjun Chen","orcid":"https://orcid.org/0000-0002-4991-9558","observed_orcids":["https://orcid.org/0000-0002-4991-9558"]},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"The University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Yangjun Chen","raw_affiliation_strings":["University of Winnipeg, Manitoba, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Winnipeg, Manitoba, Canada","institution_ids":["https://openalex.org/I872945872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5115602977"],"corresponding_institution_ids":["https://openalex.org/I872945872"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1091","last_page":"1092"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9761000275611877,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9761000275611877,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.01590000092983246,"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.005200000014156103,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9929999709129333},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9459999799728394},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.5059999823570251},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6639999747276306},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.9599999785423279}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.882845938205719},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.8473535776138306},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.7517268657684326},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6890312433242798},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6450812816619873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5950095653533936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5592542886734009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.507784903049469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3907128572463989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34178072214126587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3413783311843872},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3186393976211548},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12725171446800232},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09173417091369629}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/967900.968121","doi":"https://doi.org/10.1145/967900.968121","is_oa":false,"landing_page_url":"https://doi.org/10.1145/967900.968121","pdf_url":null,"source":{"id":"https://openalex.org/S4306417581","display_name":"ACM Symposium on Applied Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 ACM symposium on Applied computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1988615825","https://openalex.org/W2752061190","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W2070992781","https://openalex.org/W7098636474","https://openalex.org/W1578808377","https://openalex.org/W28983513","https://openalex.org/W1994373792","https://openalex.org/W7097095612","https://openalex.org/W2122362506","https://openalex.org/W33760710","https://openalex.org/W4310997217","https://openalex.org/W2790619200"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,29],"new":[6],"algorithm":[7],"for":[8],"computing":[9],"transitive":[10],"closures.":[11],"It":[12],"needs":[13],"only":[14],"O(e\u00b7b)":[15],"time":[16],"and":[17,40],"O(n\u00b7b)":[18],"space,":[19],"where":[20],"n":[21],"represents":[22],"the":[23,26,35,38,42],"number":[24],"of":[25,28,37],"nodes":[27],"DAG":[30],"(directed":[31],"acyclic":[32],"graph),":[33],"e":[34],"numbers":[36],"edges,":[39],"b":[41],"DAG's":[43],"breadth.":[44]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1978268649","counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
