{"id":"https://openalex.org/W2004090025","doi":"https://doi.org/10.1137/0213036","title":"Efficient Parallel Algorithms for a Class of Graph Theoretic Problems","display_name":"Efficient Parallel Algorithms for a Class of Graph Theoretic Problems","publication_year":1984,"publication_date":"1984-08-01","ids":{"openalex":"https://openalex.org/W2004090025","doi":"https://doi.org/10.1137/0213036","mag":"2004090025"},"language":"en","primary_location":{"id":"doi:10.1137/0213036","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213036","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/A5079730652","display_name":"Yung H. Tsin","orcid":"https://orcid.org/0000-0001-5987-4659"},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Yung H. Tsin","raw_affiliation_strings":["Univ. of Alberta, Alberta, Canada and Memorial University of Newfoundland, Newfoundland, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of Alberta, Alberta, Canada and Memorial University of Newfoundland, Newfoundland, Canada","institution_ids":["https://openalex.org/I130438778"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112411983","display_name":"Francis Y. L. Chin","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Francis Y. Chin","raw_affiliation_strings":["University of Alberta, Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Alberta, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079730652"],"corresponding_institution_ids":["https://openalex.org/I130438778"],"apc_list":null,"apc_paid":null,"fwci":13.2496,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.9892222,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"3","first_page":"580","last_page":"599"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.6375422477722168},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6197198629379272},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.5225322246551514},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4853293001651764},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4728921949863434},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4409128427505493},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4295251965522766},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42265474796295166},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.41282278299331665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32746201753616333},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3154603838920593},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16433066129684448}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6375422477722168},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6197198629379272},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.5225322246551514},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4853293001651764},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4728921949863434},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4409128427505493},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4295251965522766},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42265474796295166},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.41282278299331665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32746201753616333},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3154603838920593},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16433066129684448},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0213036","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213036","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:hub.hku.hk:10722/152217","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/152217","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.5899999737739563}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1493041473","https://openalex.org/W1963965124","https://openalex.org/W2004350101","https://openalex.org/W2004618348","https://openalex.org/W2020810308","https://openalex.org/W2024760761","https://openalex.org/W2069446854","https://openalex.org/W2071939274","https://openalex.org/W2073491596","https://openalex.org/W2075488055","https://openalex.org/W2086825382","https://openalex.org/W2130566259","https://openalex.org/W2295092271","https://openalex.org/W3133279294"],"related_works":["https://openalex.org/W2534771569","https://openalex.org/W2037547261","https://openalex.org/W4311812695","https://openalex.org/W1993644742","https://openalex.org/W4242015792","https://openalex.org/W2291920536","https://openalex.org/W338671845","https://openalex.org/W2156346058","https://openalex.org/W1598922803","https://openalex.org/W2131310250"],"abstract_inverted_index":{"In":[0,86],"this":[1],"paper,":[2],"we":[3,139],"present":[4],"efficient":[5],"parallel":[6],"algorithms":[7,54,66,77,90,97,116],"for":[8,18,125],"the":[9,14,46,56,63,75,94,103,122,129,132,142,157],"following":[10],"graph":[11],"problems:":[12],"finding":[13,25],"lowest":[15],"common":[16],"ancestors":[17],"vertex":[19],"pairs":[20],"of":[21,48,105,111,131],"a":[22,29,109,146],"directed":[23,30],"tree;":[24],"all":[26,33,35,38,41,87],"fundamental":[27],"cycles,":[28],"spanning":[31],"forest,":[32],"bridges,":[34],"bridge-connected":[36],"components,":[37,43],"separation":[39],"vertices,":[40],"biconnected":[42],"and":[44,74,98],"testing":[45],"biconnectivity":[47],"an":[49],"undirected":[50],"graph.":[51],"All":[52],"these":[53],"achieve":[55],"$O(\\lg":[57],"^2":[58,81],"n)$":[59],"time":[60],"bound,":[61],"with":[62,119,128],"first":[64,133],"two":[65,134],"using":[67,78],"$n\\lceil":[68,79],"n":[69,82],"/\\lg":[70],"n\\rceil":[71],"$":[72,84],"processors":[73,106],"remaining":[76],"n/\\lg":[80],"\\rceil":[83],"processors.":[85],"cases,":[88],"our":[89,115],"are":[91,117],"better":[92],"than":[93],"previously":[95],"known":[96],"in":[99],"most":[100],"cases":[101],"reduce":[102],"number":[104],"used":[107],"by":[108],"factor":[110],"$n\\lg":[112],"n$.":[113],"Moreover,":[114],"optimal":[118],"respect":[120],"to":[121,156],"time-processor":[123],"product":[124],"dense":[126],"graphs,":[127],"exception":[130],"algorithms.":[135],"The":[136],"machine":[137],"model":[138,148],"use":[140],"is":[141,145],"PRAM":[143],"which":[144],"SIMD":[147],"allowing":[149],"simultaneous":[150,154],"reads":[151],"but":[152],"not":[153],"writes":[155],"same":[158],"memory":[159],"location.":[160]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-19T08:33:51.333923","created_date":"2016-06-24T00:00:00"}