{"id":"https://openalex.org/W2109767783","doi":"https://doi.org/10.1002/rsa.3240010106","title":"The transitive closure of a random digraph","display_name":"The transitive closure of a random digraph","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2109767783","doi":"https://doi.org/10.1002/rsa.3240010106","mag":"2109767783"},"language":"en","primary_location":{"id":"doi:10.1002/rsa.3240010106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240010106","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","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/A5068875104","display_name":"Richard M. Karp","orcid":null},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":["University of California at Berkeley, Berkeley, CA 94720 and International Computer Science Institute, Berkeley, CA 94720"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, CA 94720 and International Computer Science Institute, Berkeley, CA 94720","institution_ids":["https://openalex.org/I1297971548"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068875104"],"corresponding_institution_ids":["https://openalex.org/I1297971548"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":6.4682,"has_fulltext":false,"cited_by_count":221,"citation_normalized_percentile":{"value":0.97447487,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"1","issue":"1","first_page":"73","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/digraph","display_name":"Digraph","score":0.9208540916442871},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.9055140614509583},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7872527837753296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7405197620391846},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7357890605926514},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6951196193695068},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5955488085746765},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5351389646530151},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.429523766040802},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07181930541992188},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05107104778289795}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9208540916442871},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9055140614509583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7872527837753296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7405197620391846},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7357890605926514},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6951196193695068},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5955488085746765},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5351389646530151},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.429523766040802},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07181930541992188},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05107104778289795},{"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":2,"locations":[{"id":"doi:10.1002/rsa.3240010106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240010106","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.647.148","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.647.148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://http.icsi.berkeley.edu/ftp/global/pub/techreports/1989/tr-89-047.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1577466578","https://openalex.org/W1981780076","https://openalex.org/W1994373792","https://openalex.org/W2024631575","https://openalex.org/W2568511220","https://openalex.org/W2905110430","https://openalex.org/W3011766368","https://openalex.org/W4244638572","https://openalex.org/W4297962570"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2050086418","https://openalex.org/W2012063573","https://openalex.org/W1982015164","https://openalex.org/W203725150","https://openalex.org/W4230967508"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"a":[2,33,48,63,139,231],"random":[3,34,49],"n":[4,55,95,159,173,175,201],"\u2010vertex":[5],"digraph,":[6],"each":[7],"arc":[8],"is":[9,56,60,70,99,141,170,181,230],"present":[10,37],"with":[11],"probability":[12],"p":[13,161],",":[14,162,219],"independently":[15],"of":[16,21,28,32,43,47,77,106,130,138,158,167,194,226,233],"the":[17,26,29,41,44,78,86,100,107,119,122,135,163,168,189,192,195,204,207,211],"presence":[18],"or":[19],"absence":[20],"other":[22],"arcs.":[23,234],"We":[24,51],"investigate":[25],"structure":[27],"strong":[30,79,89,124,128],"components":[31,80,129],"digraph":[35],"and":[36,58,84,160,222,228],"an":[38,182],"algorithm":[39,149,169,205],"for":[40,155],"construction":[42],"transitive":[45,147,196,208],"closure":[46,148,197,209],"digraph.":[50],"show":[52],"that,":[53],"when":[54],"large":[57,88,123],"np":[59],"equal":[61],"to":[62],"constant":[64],"c":[65],"greater":[66],"than":[67],"1,":[68,145],"it":[69],"very":[71,82],"likely":[72],"that":[73,85,134,191],"all":[74,118,156],"but":[75],"one":[76],"are":[81,224],"small,":[83],"unique":[87,101],"component":[90,125],"contains":[91],"about":[92],"\u0398":[93,98],"2":[94,202],"vertices,":[96,227],"where":[97,179,220],"root":[102],"in":[103,127,151,210],"[0,":[104],"1]":[105],"equation":[108],"1":[109],"\u2212":[110,112],"x":[111],"e":[113],"\u2212ex":[114],"=":[115],"0.":[116],"Nearly":[117],"vertices":[120],"outside":[121],"line":[126],"size":[131,193],"1.":[132],"Provided":[133],"expected":[136,152,164],"degree":[137],"vertex":[140],"bounded":[142],"away":[143],"from":[144],"our":[146],"runs":[150],"time":[153,166],"O(n).":[154],"choices":[157],"execution":[165],"O(w(n)":[171],"(":[172],"log":[174],")":[176,203],"4/3":[177],"),":[178],"w(n)":[180],"arbitrary":[183],"nondecreasing":[184],"unbounded":[185],"function.":[186],"To":[187],"circumvent":[188],"fact":[190],"may":[198],"be":[199],"\u03a9(":[200],"presents":[206],"compact":[212],"form":[213],"(A":[214],"\u00d7":[215],"B)":[216],"U":[217],"C":[218,229],"A":[221],"B":[223],"sets":[225],"set":[232]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}