{"id":"https://openalex.org/W1968579524","doi":"https://doi.org/10.1109/hipc.2013.6799125","title":"Work efficient parallel algorithms for large graph exploration","display_name":"Work efficient parallel algorithms for large graph exploration","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W1968579524","doi":"https://doi.org/10.1109/hipc.2013.6799125","mag":"1968579524"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2013.6799125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5002481103","display_name":"Dip Sankar Banerjee","orcid":"https://orcid.org/0000-0002-0476-1224"},"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":"Dip Sankar Banerjee","raw_affiliation_strings":["Int. Inst. of Inf. Technol., Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"Int. Inst. of Inf. Technol., Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103511695","display_name":"Shashank Sharma","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":"Shashank Sharma","raw_affiliation_strings":["Int. Inst. of Inf. Technol., Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"Int. Inst. of Inf. Technol., Hyderabad, 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":["Int. Inst. of Inf. Technol., Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"Int. Inst. of Inf. Technol., Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.961,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":20,"citation_normalized_percentile":{"value":0.632291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":91},"biblio":{"volume":null,"issue":null,"first_page":"433","last_page":"442"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998,"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.9998,"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.9974,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9974,"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/graph-traversal","display_name":"Graph traversal","score":0.81177056},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph Algorithms","score":0.59216803},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.49203083},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.47731838},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.4767017},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4509012},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4494554}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.81177056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.78384405},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.59216803},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.52380836},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.52113277},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.49203083},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4846159},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.47731838},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.4767017},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4509012},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4494554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43915394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43393815},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.24926963},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15026233},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2013.6799125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.56,"id":"https://metadata.un.org/sdg/9"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":28,"referenced_works":["https://openalex.org/W116402479","https://openalex.org/W146866247","https://openalex.org/W1504291959","https://openalex.org/W1849256610","https://openalex.org/W1978583881","https://openalex.org/W1980153429","https://openalex.org/W1985291160","https://openalex.org/W1998992875","https://openalex.org/W2001383125","https://openalex.org/W2004350101","https://openalex.org/W2021685712","https://openalex.org/W2022980325","https://openalex.org/W2028583484","https://openalex.org/W2034924661","https://openalex.org/W2035449679","https://openalex.org/W2046946959","https://openalex.org/W2055497547","https://openalex.org/W2061660549","https://openalex.org/W2072637458","https://openalex.org/W2112722706","https://openalex.org/W2113300255","https://openalex.org/W2113734991","https://openalex.org/W2124200646","https://openalex.org/W2127063935","https://openalex.org/W2149569491","https://openalex.org/W2156519507","https://openalex.org/W2752885492","https://openalex.org/W2951947541"],"related_works":["https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W4230405657","https://openalex.org/W2887020706","https://openalex.org/W2797291190","https://openalex.org/W2786956989","https://openalex.org/W2200188075","https://openalex.org/W2007113317","https://openalex.org/W1978615272","https://openalex.org/W1821961669"],"abstract_inverted_index":{"Graph":[0],"algorithms":[1,202],"play":[2],"a":[3,24,40,72,129,156,204,209,213],"prominent":[4],"role":[5],"in":[6,50,102],"several":[7,32],"fields":[8],"of":[9,23,35,42,56,137,142,152,208,222],"sciences":[10],"and":[11,26,189,212],"engineering.":[12],"Notable":[13],"among":[14],"them":[15],"are":[16,31,97],"graph":[17,89,126,144,180],"traversal,":[18],"finding":[19],"the":[20,36,54,57,92,135,138,143,150,153,161,164,169,174,233],"connected":[21],"components":[22],"graph,":[25,163],"computing":[27],"shortest":[28],"paths.":[29],"There":[30],"efficient":[33,109],"implementations":[34],"above":[37,175],"problems":[38],"on":[39,117,149,177,203,242],"variety":[41],"modern":[43,118],"multiprocessor":[44],"architectures.":[45,120],"It":[46],"can":[47,145],"be":[48,146],"noticed":[49],"recent":[51],"times":[52],"that":[53,59,131,240],"size":[55,136],"graphs":[58,96,116],"correspond":[60],"to":[61,75,133,168,226,235],"real":[62],"world":[63],"data":[64],"sets":[65],"has":[66,232],"been":[67],"increasing.":[68],"Parallelism":[69],"offers":[70],"only":[71],"limited":[73],"succor":[74],"this":[76,122,216],"situation":[77],"as":[78,128],"current":[79],"parallel":[80,119],"architectures":[81],"have":[82],"severe":[83],"short-comings":[84],"when":[85],"deployed":[86],"for":[87,106,160],"most":[88],"algorithms.":[90,244],"At":[91],"same":[93],"time,":[94],"these":[95,243],"also":[98],"getting":[99],"very":[100],"sparse":[101,115],"nature.":[103],"This":[104],"calls":[105],"particular":[107],"work":[108],"solutions":[110],"aimed":[111],"at":[112],"processing":[113],"large,":[114],"In":[121],"paper,":[123],"we":[124,199,218],"introduce":[125],"pruning":[127],"technique":[130,176],"aims":[132],"reduce":[134],"graph.":[139,171],"Certain":[140],"elements":[141],"pruned":[147,162],"depending":[148],"nature":[151],"computation.":[154],"Once":[155],"solution":[157,165],"is":[158,166],"obtained":[159],"extended":[167],"entire":[170],"We":[172],"apply":[173],"three":[178],"fundamental":[179],"algorithms:":[181],"breadth":[182],"first":[183],"search":[184],"(BFS),":[185],"Connected":[186],"Components":[187],"(CC),":[188],"All":[190],"Pairs":[191],"Shortest":[192],"Paths":[193],"(APSP).":[194],"To":[195],"validate":[196],"our":[197,201],"technique,":[198],"implement":[200],"heterogeneous":[205],"platform":[206],"consisting":[207],"multicore":[210],"CPU":[211],"GPU.":[214],"On":[215],"platform,":[217],"achieve":[219],"an":[220,230],"average":[221],"35%":[223],"improvement":[224,231],"compared":[225],"state-ofthe-art":[227],"solutions.":[228],"Such":[229],"potential":[234],"speed":[236],"up":[237],"other":[238],"applications":[239],"rely":[241]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1968579524","counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2}],"updated_date":"2025-01-21T03:41:10.836845","created_date":"2016-06-24"}