{"id":"https://openalex.org/W2038086027","doi":"https://doi.org/10.1016/0020-0190(86)90021-9","title":"An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs","display_name":"An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs","publication_year":1986,"publication_date":"1986-04-01","ids":{"openalex":"https://openalex.org/W2038086027","doi":"https://doi.org/10.1016/0020-0190(86)90021-9","mag":"2038086027"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(86)90021-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(86)90021-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/A5048080334","display_name":"Brigitte Jaumard","orcid":"https://orcid.org/0000-0003-3443-4918"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brigitte Jaumard","raw_affiliation_strings":["RUTCOR \u2014 Rutgers Center for Operations Research, Hill Center for the Mathematical Sciences, Rutgers State University of New Jersey, New Brunswick, NJ 08903, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RUTCOR \u2014 Rutgers Center for Operations Research, Hill Center for the Mathematical Sciences, Rutgers State University of New Jersey, New Brunswick, NJ 08903, U.S.A","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107422564","display_name":"Michel Minoux","orcid":null},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michel Minoux","raw_affiliation_strings":["LAMSADE, University Paris IX \u2014 Dauphine, Place du Mar\u00e9chal de Lattre de Tassigny, 75016 Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, University Paris IX \u2014 Dauphine, Place du Mar\u00e9chal de Lattre de Tassigny, 75016 Paris, France","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2590,"currency":"USD","value_usd":2590},"apc_paid":null,"fwci":0.9824,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7481577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"4","first_page":"163","last_page":"169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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.9984999895095825,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"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.9980999827384949,"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.9597063064575195},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.9244194626808167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6413394212722778},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6290848255157471},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6266080141067505},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5657270550727844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5462004542350769},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4117327928543091},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40920859575271606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3962011933326721},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.26965153217315674},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.24540823698043823},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.24059295654296875}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9597063064575195},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.9244194626808167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6413394212722778},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6290848255157471},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6266080141067505},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5657270550727844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5462004542350769},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4117327928543091},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40920859575271606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3962011933326721},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26965153217315674},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.24540823698043823},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.24059295654296875},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":1,"locations":[{"id":"doi:10.1016/0020-0190(86)90021-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(86)90021-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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W74021744","https://openalex.org/W90346837","https://openalex.org/W198808598","https://openalex.org/W423069184","https://openalex.org/W1655990431","https://openalex.org/W1965253335","https://openalex.org/W1972332180","https://openalex.org/W1983301762","https://openalex.org/W1994373792","https://openalex.org/W2001852623","https://openalex.org/W2027386599","https://openalex.org/W2035476608","https://openalex.org/W2039829163","https://openalex.org/W2047783181","https://openalex.org/W2054633003","https://openalex.org/W2070992781","https://openalex.org/W2075536906","https://openalex.org/W2080548021","https://openalex.org/W2090914082","https://openalex.org/W2104734478","https://openalex.org/W2118382442","https://openalex.org/W2140232587","https://openalex.org/W2545919726","https://openalex.org/W4206601672","https://openalex.org/W6637190722","https://openalex.org/W6729749364"],"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":null,"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}