{"id":"https://openalex.org/W2060759452","doi":"https://doi.org/10.1137/s0097539792227077","title":"Planar Strong Connectivity Helps in Parallel Depth-First Search","display_name":"Planar Strong Connectivity Helps in Parallel Depth-First Search","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W2060759452","doi":"https://doi.org/10.1137/s0097539792227077","mag":"2060759452"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792227077","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792227077","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/A5109219665","display_name":"Ming\u2010Yang Kao","orcid":null},"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":true,"raw_author_name":"Ming-Yang Kao","raw_affiliation_strings":["Duke University"],"affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109219665"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":1.1761,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82997181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":"1","first_page":"46","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6418598294258118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6416705846786499},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6393944025039673},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5165173411369324},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5084599256515503},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5067434906959534},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5021135807037354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49285244941711426},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.47110727429389954},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.45474502444267273},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4357251822948456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41848036646842957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34101176261901855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3307700753211975},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.24952316284179688},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23644152283668518}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6418598294258118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6416705846786499},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6393944025039673},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5165173411369324},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5084599256515503},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5067434906959534},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5021135807037354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49285244941711426},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.47110727429389954},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.45474502444267273},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4357251822948456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41848036646842957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34101176261901855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3307700753211975},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.24952316284179688},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23644152283668518},{"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":2,"locations":[{"id":"doi:10.1137/s0097539792227077","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792227077","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.1798","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.1798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.duke.edu/pub/dist/techreport/1992/1992-03.ps.gz","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":31,"referenced_works":["https://openalex.org/W1519160786","https://openalex.org/W1523679426","https://openalex.org/W1532566247","https://openalex.org/W1655990431","https://openalex.org/W1965874601","https://openalex.org/W1998292573","https://openalex.org/W1998776409","https://openalex.org/W2015439916","https://openalex.org/W2020283440","https://openalex.org/W2034282023","https://openalex.org/W2037233409","https://openalex.org/W2038176627","https://openalex.org/W2038643780","https://openalex.org/W2041200781","https://openalex.org/W2047198574","https://openalex.org/W2049021301","https://openalex.org/W2049327803","https://openalex.org/W2049413646","https://openalex.org/W2056711744","https://openalex.org/W2082419751","https://openalex.org/W2084593768","https://openalex.org/W2085467310","https://openalex.org/W2105487688","https://openalex.org/W2118382442","https://openalex.org/W2125663002","https://openalex.org/W2143462372","https://openalex.org/W2152407429","https://openalex.org/W2170132497","https://openalex.org/W4210731599","https://openalex.org/W4213214460","https://openalex.org/W4213327355"],"related_works":["https://openalex.org/W3098335909","https://openalex.org/W2037710955","https://openalex.org/W2008046591","https://openalex.org/W2766273876","https://openalex.org/W2371032224","https://openalex.org/W1974899466","https://openalex.org/W1978615272","https://openalex.org/W2049713017","https://openalex.org/W2146073828","https://openalex.org/W2023670982"],"abstract_inverted_index":{"This":[0],"paper":[1],"proves":[2],"that":[3,40,68],"for":[4,36],"a":[5,14,20,63,83],"strongly":[6,44],"connected":[7],"planar":[8,37],"directed":[9,38],"graph":[10],"of":[11,82],"size":[12],"n,":[13],"depth-first":[15,48],"search":[16,49],"tree":[17],"rooted":[18],"at":[19],"specified":[21],"vertex":[22],"can":[23],"be":[24,43],"computed":[25],"in":[26,52,75,80],"$O(\\log^{5}":[27],"n)$":[28,54],"time":[29,55],"with":[30,56],"$n/":[31],"\\log":[32],"n$":[33],"processors.":[34,58],"Previously,":[35],"graphs":[39],"may":[41],"not":[42],"connected,":[45],"the":[46],"best":[47],"algorithm":[50],"runs":[51],"$O(\\log^{10}":[53],"n":[57],"Both":[59],"algorithms":[60],"run":[61],"on":[62],"parallel":[64],"random":[65],"access":[66],"machine":[67],"allows":[69],"concurrent":[70,73],"reads":[71],"and":[72,79],"writes":[74],"its":[76],"shared":[77],"memory,":[78],"case":[81],"write":[84],"conflict,":[85],"permits":[86],"an":[87],"arbitrary":[88],"processor":[89],"to":[90],"succeed.":[91]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}