{"id":"https://openalex.org/W2039972044","doi":"https://doi.org/10.1145/100216.100237","title":"Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs","display_name":"Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs","alternate_titles":[],"publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2039972044","doi":"https://doi.org/10.1145/100216.100237","mag":"2039972044"},"language":"en","primary_location":{"id":"doi:10.1145/100216.100237","doi":"https://doi.org/10.1145/100216.100237","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100237","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100237","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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 twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2039972044"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100237","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109152103","display_name":"M.-Y. Kao","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.-Y. Kao","raw_affiliation_strings":["Department of Computer Science, Duke University, Durham, North Carolina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, North Carolina","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. N. Klein","raw_affiliation_strings":["Department of Computer Science, Brown University, Providence, Rhode Island"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, Rhode Island","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.551,"has_fulltext":true,"cited_by_count":38,"citation_normalized_percentile":{"value":0.88940629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"181","last_page":"192"},"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.9818999767303467,"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.9818999767303467,"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.012400000356137753,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0038999998942017555,"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/planar-digraphs","display_name":"planar digraphs","score":0.8429999947547913},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9390000104904175},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"topological sorting","score":0.968999981880188},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"depth-first search","score":0.9890000224113464}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9636627435684204},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.830142617225647},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6808491945266724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6241196990013123},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.5867184996604919},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5428324937820435},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5061306357383728},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5023210048675537},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.359496533870697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29796546697616577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2619464695453644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22623276710510254},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09791576862335205},{"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},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/100216.100237","doi":"https://doi.org/10.1145/100216.100237","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100237","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100237","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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 twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/100216.100237","doi":"https://doi.org/10.1145/100216.100237","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100237","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100237","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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 twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G7389811833","display_name":"RIA:  Depth-First Search as a Divide-and-Conquer Tool","funder_award_id":"8909323","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309622","display_name":"Harvard University","ror":"https://ror.org/03vek6s52"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2039972044.pdf","grobid_xml":"https://content.openalex.org/works/W2039972044.grobid-xml"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W102881553","https://openalex.org/W1484040084","https://openalex.org/W1503004197","https://openalex.org/W1523679426","https://openalex.org/W1525833494","https://openalex.org/W1531625822","https://openalex.org/W1585069742","https://openalex.org/W1586466644","https://openalex.org/W1595140484","https://openalex.org/W1607171523","https://openalex.org/W1655990431","https://openalex.org/W1965874601","https://openalex.org/W1967816223","https://openalex.org/W1978438623","https://openalex.org/W1995040285","https://openalex.org/W1998776409","https://openalex.org/W2004350101","https://openalex.org/W2013444956","https://openalex.org/W2013781411","https://openalex.org/W2020283440","https://openalex.org/W2025057636","https://openalex.org/W2030999197","https://openalex.org/W2034282023","https://openalex.org/W2038176627","https://openalex.org/W2038643780","https://openalex.org/W2041200781","https://openalex.org/W2046461289","https://openalex.org/W2049327803","https://openalex.org/W2049413646","https://openalex.org/W2050021819","https://openalex.org/W2051161834","https://openalex.org/W2056711744","https://openalex.org/W2061303458","https://openalex.org/W2061420453","https://openalex.org/W2080063509","https://openalex.org/W2084593768","https://openalex.org/W2085467310","https://openalex.org/W2088570605","https://openalex.org/W2098265073","https://openalex.org/W2101496488","https://openalex.org/W2105114849","https://openalex.org/W2105487688","https://openalex.org/W2118382442","https://openalex.org/W2125663002","https://openalex.org/W2131399793","https://openalex.org/W2138560648","https://openalex.org/W2143462372","https://openalex.org/W2148686552","https://openalex.org/W2534652523","https://openalex.org/W2799004609","https://openalex.org/W3022690009","https://openalex.org/W3145802425","https://openalex.org/W4300303686","https://openalex.org/W6603117841","https://openalex.org/W6603309814","https://openalex.org/W6610919680","https://openalex.org/W6699982930","https://openalex.org/W6817651155"],"related_works":["https://openalex.org/W1587455781","https://openalex.org/W141371466","https://openalex.org/W1973133255","https://openalex.org/W1974462315","https://openalex.org/W1594925095","https://openalex.org/W2767323816","https://openalex.org/W1895475003","https://openalex.org/W2025057636","https://openalex.org/W2023300502","https://openalex.org/W1971715758"],"abstract_inverted_index":{"Currently,":[0],"there":[1],"is":[2],"a":[3,25,48,106],"significant":[4],"gap":[5],"between":[6],"the":[7,40,43,74,102],"best":[8],"sequential":[9],"and":[10,61,90,99],"parallel":[11,34],"complexities":[12],"of":[13,42,50,109],"many":[14],"fundamental":[15],"problems":[16],"related":[17],"to":[18,104],"digraph":[19,37,85],"reachability.This":[20],"complexity":[21,103],"bottleneck":[22],"essentially":[23],"reflects":[24],"seemingly":[26],"unavoidable":[27],"reliance":[28],"on":[29],"transitive":[30],"closure":[31],"techniques":[32],"in":[33],"algorithms":[35,72,94],"for":[36,63,66,73],"reachability.To":[38],"pinpoint":[39],"nature":[41],"bottleneck,":[44],"we":[45,69],"de*":[46],"velop":[47],"collection":[49],"polylog-time":[51,71],"reductions":[52,56],"among":[53],"reachability":[54],"problems.These":[55],"use":[57,95],"only":[58,96],"linear":[59,97],"processors":[60,98],"work":[62],"general":[64],"graphs.Furthermore,":[65],"planar":[67],"digraphs,":[68],"give":[70],"following":[75],"problems:":[76],"(1)":[77],"directed":[78],"ear":[79],"decomposition,":[80],"(2)":[81],"topological":[82],"ordering,":[83],"(3)":[84],"reachability,":[86],"(4)":[87],"descendent":[88],"counting,":[89],"(5)":[91],"depth-first":[92],"search.These":[93],"therefore":[100],"reduce":[101],"within":[105],"polylog":[107],"factor":[108],"optimal.":[110]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2039972044","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
