{"id":"https://openalex.org/W2786585192","doi":"https://doi.org/10.1109/ic3.2017.8284293","title":"A fast GPU algorithm for biconnected components","display_name":"A fast GPU algorithm for biconnected components","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2786585192","doi":"https://doi.org/10.1109/ic3.2017.8284293","mag":"2786585192"},"language":"en","primary_location":{"id":"doi:10.1109/ic3.2017.8284293","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2017.8284293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Tenth International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-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/A5018293840","display_name":"Mihir Wadwekar","orcid":null},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mihir Wadwekar","raw_affiliation_strings":["Centre for Security, Theory and Algorithmic Research, International Institute of Information Technology Hyderabad, Hyderabad, Telangana, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Security, Theory and Algorithmic Research, International Institute of Information Technology Hyderabad, Hyderabad, Telangana, India","institution_ids":["https://openalex.org/I64189192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023412602","display_name":"Kishore Kothapalli","orcid":"https://orcid.org/0000-0001-5523-4494"},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kishore Kothapalli","raw_affiliation_strings":["Centre for Security, Theory and Algorithmic Research, International Institute of Information Technology Hyderabad, Hyderabad, Telangana, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Security, Theory and Algorithmic Research, International Institute of Information Technology Hyderabad, Hyderabad, Telangana, India","institution_ids":["https://openalex.org/I64189192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2771,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.66578728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/computer-science","display_name":"Computer science","score":0.8374207615852356},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7467014789581299},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5760217308998108},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5120623707771301},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5094547867774963},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.49549734592437744},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4889277517795563},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.4828365445137024},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4620901942253113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4263593852519989},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4188060164451599},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4049244523048401},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14327886700630188},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10444295406341553},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09055086970329285}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8374207615852356},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7467014789581299},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5760217308998108},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5120623707771301},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5094547867774963},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.49549734592437744},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4889277517795563},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.4828365445137024},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4620901942253113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4263593852519989},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4188060164451599},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4049244523048401},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14327886700630188},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10444295406341553},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09055086970329285},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ic3.2017.8284293","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2017.8284293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Tenth International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W67385939","https://openalex.org/W390146837","https://openalex.org/W1539701003","https://openalex.org/W1652786420","https://openalex.org/W1985291160","https://openalex.org/W1995040285","https://openalex.org/W2012310530","https://openalex.org/W2038497593","https://openalex.org/W2061983247","https://openalex.org/W2082398795","https://openalex.org/W2120490947","https://openalex.org/W2154702940","https://openalex.org/W2275415136","https://openalex.org/W2585565556","https://openalex.org/W2725398544","https://openalex.org/W2905110430","https://openalex.org/W3117864297","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W6682877418"],"related_works":["https://openalex.org/W2032508741","https://openalex.org/W2363538625","https://openalex.org/W1570785333","https://openalex.org/W4297775710","https://openalex.org/W2378879926","https://openalex.org/W2569496247","https://openalex.org/W4384919997","https://openalex.org/W2368274531","https://openalex.org/W4312580075","https://openalex.org/W2052453197"],"abstract_inverted_index":{"Finding":[0],"the":[1,5,23,51,56,62,76],"articulation":[2],"points":[3],"and":[4,27,40,60],"biconnected":[6],"components":[7],"of":[8,16,53],"an":[9,71,83],"undirected":[10],"graph":[11,20],"has":[12],"been":[13,31],"a":[14,42,89],"problem":[15],"huge":[17],"interest":[18],"in":[19,88],"theory.":[21],"Over":[22],"years,":[24],"several":[25],"sequential":[26],"parallel":[28,44],"algorithms":[29],"have":[30],"presented":[32],"for":[33,93],"this":[34],"problem.":[35],"Our":[36],"paper":[37],"here":[38],"presents":[39],"implements":[41],"fast":[43],"algorithm":[45],"on":[46,70],"GPU":[47],"which":[48,86],"is":[49,69],"to":[50],"best":[52,78],"our":[54],"knowledge":[55],"first":[57],"such":[58],"attempt":[59],"also":[61,81],"fastest":[63],"implementation":[64,68],"across":[65],"architectures.":[66],"The":[67],"average":[72],"4\u00d7":[73],"faster":[74],"then":[75],"next":[77],"implementation.":[79],"We":[80],"apply":[82],"edge-pruning":[84],"technique":[85],"results":[87],"further":[90],"2\u00d7":[91],"speedup":[92],"dense":[94],"graphs.":[95]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}