{"id":"https://openalex.org/W1539701003","doi":"https://doi.org/10.1109/hipc.2014.7116914","title":"Simple parallel biconnectivity algorithms for multicore platforms","display_name":"Simple parallel biconnectivity algorithms for multicore platforms","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W1539701003","doi":"https://doi.org/10.1109/hipc.2014.7116914","mag":"1539701003"},"language":"en","primary_location":{"id":"doi:10.1109/hipc.2014.7116914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2014.7116914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 21st International Conference on High Performance Computing (HiPC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5038499316","display_name":"George M. Slota","orcid":"https://orcid.org/0000-0002-4709-4724"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George M. Slota","raw_affiliation_strings":["Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057403059","display_name":"Kamesh Madduri","orcid":"https://orcid.org/0000-0003-4344-0957"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kamesh Madduri","raw_affiliation_strings":["Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9934999942779541,"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/T10083","display_name":"Graphene research and applications","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.8125521540641785},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.7095202207565308},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5919559001922607},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5693628191947937},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5474274158477783},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5045322179794312},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4695858359336853},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4586202800273895},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4568399488925934},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4308462142944336},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38940006494522095},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3844074010848999},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.38194647431373596},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.0927514135837555}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8125521540641785},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.7095202207565308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5919559001922607},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5693628191947937},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5474274158477783},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5045322179794312},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4695858359336853},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4586202800273895},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4568399488925934},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4308462142944336},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38940006494522095},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3844074010848999},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.38194647431373596},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0927514135837555}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hipc.2014.7116914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2014.7116914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 21st International Conference on High Performance Computing (HiPC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332369","display_name":"National Nuclear Security Administration","ror":"https://ror.org/03sk1we31"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1482680420","https://openalex.org/W1513831565","https://openalex.org/W1536990859","https://openalex.org/W1606724249","https://openalex.org/W1814023381","https://openalex.org/W1967816223","https://openalex.org/W1995040285","https://openalex.org/W1996575062","https://openalex.org/W2002055996","https://openalex.org/W2004090025","https://openalex.org/W2010255818","https://openalex.org/W2020810308","https://openalex.org/W2035080386","https://openalex.org/W2047345171","https://openalex.org/W2048468623","https://openalex.org/W2054836401","https://openalex.org/W2061303458","https://openalex.org/W2061983247","https://openalex.org/W2069446854","https://openalex.org/W2086632974","https://openalex.org/W2114720692","https://openalex.org/W2144085134","https://openalex.org/W2154702940","https://openalex.org/W2160622836","https://openalex.org/W2400451530","https://openalex.org/W2432978112","https://openalex.org/W2484213769","https://openalex.org/W2611219145","https://openalex.org/W4253426709","https://openalex.org/W6632052733","https://openalex.org/W6636304977","https://openalex.org/W6638399519"],"related_works":["https://openalex.org/W3098335909","https://openalex.org/W2090103608","https://openalex.org/W1978615272","https://openalex.org/W2766273876","https://openalex.org/W4372047443","https://openalex.org/W2797291190","https://openalex.org/W1979870592","https://openalex.org/W2786956989","https://openalex.org/W1991539193","https://openalex.org/W1821961669"],"abstract_inverted_index":{"We":[0,84,130],"present":[1],"two":[2],"new":[3],"algorithms":[4,89],"for":[5,70],"finding":[6],"the":[7,33,37,43,66,117,127,140,161,166,176],"biconnected":[8,120],"components":[9,121],"of":[10,106,169],"a":[11,48,95,104,149],"large":[12],"undirected":[13],"sparse":[14],"graph.":[15,44],"The":[16],"first":[17,171],"algorithm":[18,69,172],"is":[19,124,173],"based":[20,125],"on":[21,126,148],"identifying":[22],"articulation":[23],"points":[24],"and":[25,32,52,72,98,135,143],"labeling":[26],"edges":[27],"using":[28],"multiple":[29],"connectivity":[30],"queries,":[31],"second":[34],"approach":[35],"uses":[36],"color":[38],"propagation":[39],"technique":[40],"to":[41,133,160],"decompose":[42],"Both":[45],"methods":[46,62,115],"use":[47],"breadth-first":[49],"spanning":[50],"tree":[51],"some":[53,156],"auxiliary":[54,81],"information":[55],"computed":[56],"during":[57],"Breadth-First":[58],"Search":[59],"(BFS).":[60],"These":[61],"are":[63],"simpler":[64],"than":[65,175],"Tarjan-Vishkin":[67,128],"PRAM":[68],"biconnectivity":[71],"do":[73],"not":[74],"require":[75],"Euler":[76],"tour":[77],"computation":[78],"or":[79],"any":[80],"graph":[82,109,157],"construction.":[83],"identify":[85],"steps":[86],"in":[87,94],"these":[88,114],"that":[90,113],"can":[91],"be":[92],"parallelized":[93],"shared-memory":[96],"environment":[97],"develop":[99],"tuned":[100],"OpenMP":[101],"implementations.":[102],"Using":[103],"collection":[105],"large-scale":[107],"real-world":[108],"instances,":[110,158],"we":[111],"show":[112],"outperform":[116],"state-of-the-art":[118],"Cong-Bader":[119,145],"implementation,":[122],"which":[123],"algorithm.":[129,179],"achieve":[131],"up":[132],"7.1\u00d7":[134],"4.2\u00d7":[136],"parallel":[137,144],"speedup":[138],"over":[139],"serial":[141,177],"Hopcroft-Tarjan":[142,178],"algorithms,":[146],"respectively,":[147],"16-core":[150],"Intel":[151],"Sandy":[152],"Bridge":[153],"system.":[154],"For":[155],"due":[159],"fast":[162],"BFS-based":[163],"preprocessing":[164],"step,":[165],"single-threaded":[167],"implementation":[168],"our":[170],"faster":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}