{"id":"https://openalex.org/W2198322846","doi":"https://doi.org/10.1109/bigdata.2015.7363957","title":"A fast parallel algorithm for counting triangles in graphs using dynamic load balancing","display_name":"A fast parallel algorithm for counting triangles in graphs using dynamic load balancing","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W2198322846","doi":"https://doi.org/10.1109/bigdata.2015.7363957","mag":"2198322846"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2015.7363957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2015.7363957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Big Data (Big Data)","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/A5033369839","display_name":"Shaikh Arifuzzaman","orcid":"https://orcid.org/0000-0002-6893-2475"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shaikh Arifuzzaman","raw_affiliation_strings":["Department of Computer Science, Virginia Tech, Blacksburg, Virginia, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Virginia Tech, Blacksburg, Virginia, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104069467","display_name":"Maleq Khan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maleq Khan","raw_affiliation_strings":["Network Dynamics & Simulation Science Laboratory, Virginia Bioinformatics Institute"],"affiliations":[{"raw_affiliation_string":"Network Dynamics & Simulation Science Laboratory, Virginia Bioinformatics Institute","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020293284","display_name":"Madhav Marathe","orcid":"https://orcid.org/0000-0003-1653-0658"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhav Marathe","raw_affiliation_strings":["Department of Computer Science, Virginia Tech, Blacksburg, Virginia, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Virginia Tech, Blacksburg, Virginia, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033369839"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":1.4282,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.82107392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"286","issue":null,"first_page":"1839","last_page":"1847"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9954000115394592,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8347963094711304},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.6521332263946533},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6072738170623779},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5928341746330261},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5678617358207703},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5506571531295776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4701041579246521},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.46044740080833435},{"id":"https://openalex.org/keywords/message-passing-interface","display_name":"Message Passing Interface","score":0.44631630182266235},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.41064897179603577},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.3669833540916443},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.30902373790740967},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30192679166793823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11858409643173218},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.07435649633407593}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8347963094711304},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.6521332263946533},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6072738170623779},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5928341746330261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5678617358207703},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5506571531295776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4701041579246521},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.46044740080833435},{"id":"https://openalex.org/C166782233","wikidata":"https://www.wikidata.org/wiki/Q127879","display_name":"Message Passing Interface","level":3,"score":0.44631630182266235},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.41064897179603577},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.3669833540916443},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.30902373790740967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30192679166793823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11858409643173218},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.07435649633407593},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/bigdata.2015.7363957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2015.7363957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.718.2176","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.718.2176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://staff.vbi.vt.edu/maleq/papers/triangle_fast.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332186","display_name":"Defense Threat Reduction Agency","ror":"https://ror.org/04tz64554"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1582397847","https://openalex.org/W1614522028","https://openalex.org/W1893161742","https://openalex.org/W1967066104","https://openalex.org/W1968414620","https://openalex.org/W1971421925","https://openalex.org/W1986745018","https://openalex.org/W1988402734","https://openalex.org/W2001125165","https://openalex.org/W2002576896","https://openalex.org/W2008620264","https://openalex.org/W2010347674","https://openalex.org/W2011267080","https://openalex.org/W2012720017","https://openalex.org/W2016311778","https://openalex.org/W2031082424","https://openalex.org/W2064069308","https://openalex.org/W2088980601","https://openalex.org/W2101196063","https://openalex.org/W2102322109","https://openalex.org/W2110814195","https://openalex.org/W2117071406","https://openalex.org/W2130354913","https://openalex.org/W2153624566","https://openalex.org/W2158291508","https://openalex.org/W2158432527","https://openalex.org/W2161130929","https://openalex.org/W2169223901","https://openalex.org/W2175110005","https://openalex.org/W2175491137","https://openalex.org/W2588458088","https://openalex.org/W3104563092","https://openalex.org/W3145724052","https://openalex.org/W4401247616","https://openalex.org/W6639711990","https://openalex.org/W6650848267","https://openalex.org/W6653124393","https://openalex.org/W6666422162","https://openalex.org/W6733915912"],"related_works":["https://openalex.org/W2366325093","https://openalex.org/W2133825528","https://openalex.org/W1998761481","https://openalex.org/W2498758832","https://openalex.org/W2154020360","https://openalex.org/W184749201","https://openalex.org/W98999783","https://openalex.org/W2314805133","https://openalex.org/W1483073283","https://openalex.org/W1544002944"],"abstract_inverted_index":{"Finding":[0],"the":[1,39,61,109,114,128,154,157,169,194,197,217,240,246,255,271],"number":[2,17,110,211,219],"of":[3,18,47,52,57,63,108,111,160,196,212,220],"triangles":[4,19,75,148,221],"in":[5,13,24,125,149,222,229],"a":[6,35,177,187,209,223],"graph":[7,14,25],"(network)":[8],"is":[9,164,242],"an":[10,141],"important":[11,22],"problem":[12],"analysis.":[15],"The":[16,101,214],"also":[20],"has":[21],"applications":[23],"mining.":[26],"Big":[27],"graphs":[28,45],"emerging":[29],"from":[30],"numerous":[31],"application":[32],"areas":[33],"pose":[34],"significant":[36],"challenge":[37],"for":[38,72,146,175,254],"analysis":[40],"and":[41,54,93,116,185,206],"mining":[42],"since":[43],"these":[44,120],"consist":[46],"millions,":[48],"or":[49,79],"even":[50],"billions,":[51],"nodes":[53],"edges.":[55],"Graphs":[56],"such":[58,176],"scale":[59],"necessitate":[60],"development":[62],"efficient":[64,142],"parallel":[65,70,144],"algorithms.":[66],"Existing":[67],"distributed":[68],"memory":[69,159],"algorithms":[71,87,104,121,248],"counting":[73,147],"exact":[74,218],"are":[76,123,130],"either":[77],"Map-Reduce":[78,85],"message":[80],"passing":[81],"interface":[82],"(MPI)":[83],"based.":[84],"based":[86,103,132],"generate":[88],"prohibitively":[89],"large":[90,150,165,210],"intermediate":[91],"data":[92],"do":[94],"not":[95],"demonstrate":[96,238],"reasonably":[97],"good":[98,204],"runtime":[99,268],"efficiency.":[100],"MPI":[102],"offer":[105],"fast":[106],"computation":[107,179],"triangles.":[112],"However,":[113],"partitioning":[115],"load":[117,180,189,276],"balancing":[118,190],"schemes":[119],"employ":[122],"static":[124,250,275],"nature":[126],"-":[127],"partitions":[129],"precomputed":[131],"on":[133],"some":[134],"estimations.":[135],"In":[136,252],"this":[137],"paper,":[138],"we":[139,258],"present":[140,186],"MPI-based":[143],"algorithm":[145,198,201,215,241,262,273],"graph.":[151,171],"We":[152,172],"consider":[153],"case":[155],"where":[156],"main":[158],"each":[161],"compute":[162],"node":[163],"enough":[166],"to":[167,208],"contain":[168],"entire":[170],"observe":[173],"that":[174,239],"case,":[178],"can":[181],"be":[182],"balanced":[183],"dynamically":[184],"dynamic":[188],"scheme":[191],"which":[192],"improves":[193],"performance":[195],"significantly.":[199],"Our":[200,236],"demonstrates":[202],"very":[203],"speedups":[205],"scales":[207],"processors.":[213,235],"computes":[216],"network":[224],"with":[225,232,249,274],"1":[226],"billion":[227],"edges":[228],"2":[230,266],"minutes":[231],"only":[233],"100":[234],"results":[237],"significantly":[243],"faster":[244],"than":[245],"related":[247],"partitioning.":[251],"fact,":[253],"real-world":[256],"networks":[257],"experimented":[259],"on,":[260],"our":[261],"achieves":[263],"at":[264],"least":[265],"times":[267],"efficiency":[269],"over":[270],"fastest":[272],"balancing.":[277]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}