{"id":"https://openalex.org/W2110920860","doi":"https://doi.org/10.1137/0201008","title":"The Transitive Reduction of a Directed Graph","display_name":"The Transitive Reduction of a Directed Graph","publication_year":1972,"publication_date":"1972-06-01","ids":{"openalex":"https://openalex.org/W2110920860","doi":"https://doi.org/10.1137/0201008","mag":"2110920860"},"language":"en","primary_location":{"id":"doi:10.1137/0201008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0201008","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5047516262","display_name":"Alfred V. Aho","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. V. Aho","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089065417","display_name":"Jeffrey D. Ullman","orcid":"https://orcid.org/0000-0002-1847-3426"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. D. Ullman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047516262"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3579,"has_fulltext":false,"cited_by_count":719,"citation_normalized_percentile":{"value":0.89486553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"1","issue":"2","first_page":"131","last_page":"137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.995199978351593,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.995199978351593,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9945999979972839,"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-reduction","display_name":"Transitive reduction","score":0.7606453895568848},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7259573936462402},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.6274334788322449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6216270327568054},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5739724636077881},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5577613115310669},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4748271405696869},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.45093852281570435},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.4500964283943176},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.439019113779068},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3762345314025879},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.3263731598854065},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3219575881958008}],"concepts":[{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.7606453895568848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7259573936462402},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6274334788322449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6216270327568054},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5739724636077881},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5577613115310669},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4748271405696869},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.45093852281570435},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.4500964283943176},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.439019113779068},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3762345314025879},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3263731598854065},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3219575881958008}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0201008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0201008","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2014637829","https://openalex.org/W2034424699","https://openalex.org/W2035476608","https://openalex.org/W2070992781","https://openalex.org/W2076447414","https://openalex.org/W2092333800","https://openalex.org/W2104734478","https://openalex.org/W2118382442","https://openalex.org/W2545919726"],"related_works":["https://openalex.org/W2075704325","https://openalex.org/W1553139688","https://openalex.org/W1503149859","https://openalex.org/W2008080405","https://openalex.org/W4366828350","https://openalex.org/W2362009423","https://openalex.org/W1895475003","https://openalex.org/W2038086027","https://openalex.org/W1972907198","https://openalex.org/W2954009223"],"abstract_inverted_index":{"We":[0],"consider":[1],"economical":[2],"representations":[3],"for":[4,96,110],"the":[5,25,93,103,107,112,119,122,126],"path":[6,37,52],"information":[7],"in":[8],"a":[9,21,35,50,88,116,130],"directed":[10,13,26,36,51,75],"graph.":[11],"A":[12],"graph":[14,27,64,117,131],"$G^t":[15,32,69],"$":[16,33,70],"is":[17,62,100,118],"said":[18],"to":[19,41,56,124,133],"be":[20],"transitive":[22,94,113,127],"reduction":[23,95,114],"of":[24,106,115,129],"G":[28,48],"provided":[29],"that":[30,102],"(i)":[31],"has":[34,49],"from":[38,53],"vertex":[39,42,54,57],"u":[40,55],"v":[43],"if":[44,47],"and":[45,59],"only":[46],"v,":[58],"(ii)":[60],"there":[61],"no":[63],"with":[65,77],"fewer":[66],"arcs":[67],"than":[68,82],"satisfying":[71],"condition":[72],"(i).":[73],"Though":[74],"graphs":[76],"cycles":[78],"may":[79],"have":[80],"more":[81],"one":[83],"such":[84,97],"representation,":[85],"we":[86],"select":[87],"natural":[89],"canonical":[90],"representative":[91],"as":[92,121],"graphs.":[98],"It":[99],"shown":[101],"time":[104,123],"complexity":[105],"best":[108],"algorithm":[109],"finding":[111],"same":[120],"compute":[125],"closure":[128],"or":[132],"perform":[134],"Boolean":[135],"matrix":[136],"multiplication.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":23},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":31},{"year":2022,"cited_by_count":37},{"year":2021,"cited_by_count":37},{"year":2020,"cited_by_count":35},{"year":2019,"cited_by_count":33},{"year":2018,"cited_by_count":33},{"year":2017,"cited_by_count":30},{"year":2016,"cited_by_count":33},{"year":2015,"cited_by_count":28},{"year":2014,"cited_by_count":30},{"year":2013,"cited_by_count":28},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}