{"id":"https://openalex.org/W3004718539","doi":"https://doi.org/10.1145/3365676","title":"Fast Parallel Algorithms for Counting and Listing Triangles in Big Graphs","display_name":"Fast Parallel Algorithms for Counting and Listing Triangles in Big Graphs","publication_year":2019,"publication_date":"2019-12-13","ids":{"openalex":"https://openalex.org/W3004718539","doi":"https://doi.org/10.1145/3365676","mag":"3004718539"},"language":"en","primary_location":{"id":"doi:10.1145/3365676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3365676","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","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/A5033369839","display_name":"Shaikh Arifuzzaman","orcid":"https://orcid.org/0000-0002-6893-2475"},"institutions":[{"id":"https://openalex.org/I192396691","display_name":"University of New Orleans","ror":"https://ror.org/034mtvk83","country_code":"US","type":"education","lineage":["https://openalex.org/I192396691","https://openalex.org/I2799628689"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shaikh Arifuzzaman","raw_affiliation_strings":["University of New Orleans, New Orleans, LA"],"affiliations":[{"raw_affiliation_string":"University of New Orleans, New Orleans, LA","institution_ids":["https://openalex.org/I192396691"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104069467","display_name":"Maleq Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I181414168","display_name":"Texas A&M University \u2013 Kingsville","ror":"https://ror.org/05abs3w97","country_code":"US","type":"education","lineage":["https://openalex.org/I181414168"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maleq Khan","raw_affiliation_strings":["Texas A8M University\u2013Kingsville, Kingsville, TX"],"affiliations":[{"raw_affiliation_string":"Texas A8M University\u2013Kingsville, Kingsville, TX","institution_ids":["https://openalex.org/I181414168"]}]},{"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/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhav Marathe","raw_affiliation_strings":["University of Virginia, Charlottesville, VA"],"affiliations":[{"raw_affiliation_string":"University of Virginia, Charlottesville, VA","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033369839"],"corresponding_institution_ids":["https://openalex.org/I192396691"],"apc_list":null,"apc_paid":null,"fwci":1.7375,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.85350945,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994999766349792,"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.9994999766349792,"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.9970999956130981,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9922999739646912,"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.7377517819404602},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6032360792160034},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5084018111228943},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5031291842460632},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3252301812171936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08406093716621399}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7377517819404602},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6032360792160034},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5084018111228943},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5031291842460632},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3252301812171936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08406093716621399}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3365676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3365676","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1893161742","https://openalex.org/W1966308040","https://openalex.org/W1967066104","https://openalex.org/W1968414620","https://openalex.org/W1971421925","https://openalex.org/W2008620264","https://openalex.org/W2016311778","https://openalex.org/W2019724001","https://openalex.org/W2093063455","https://openalex.org/W2117071406","https://openalex.org/W2130354913","https://openalex.org/W2153624566","https://openalex.org/W2158291508","https://openalex.org/W2175110005","https://openalex.org/W2338082078","https://openalex.org/W2338645642","https://openalex.org/W2518164973","https://openalex.org/W2588458088","https://openalex.org/W2593265540","https://openalex.org/W2767203711","https://openalex.org/W2913745386","https://openalex.org/W4244355921","https://openalex.org/W4302070056"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Big":[0],"graphs":[1,15],"(networks)":[2],"arising":[3],"in":[4,29,38,45,67,106,113,180],"numerous":[5],"application":[6],"areas":[7],"pose":[8],"significant":[9,140],"challengesfor":[10],"graph":[11,40,182],"analysts":[12],"as":[13],"these":[14],"grow":[16],"to":[17,27,81,92,126,160,176,195],"billions":[18,95],"of":[19,36,50,96,104,187],"nodes":[20,97],"and":[21,23,48,76,98,135,164,183],"edges":[22,112],"are":[24],"prohibitively":[25],"large":[26],"fit":[28],"the":[30,34,46,101,120,158],"main":[31],"memory.":[32],"Finding":[33],"number":[35,103],"triangles":[37,66,105,179],"a":[39,83,107,127,139,149,162,181,196],"is":[41],"an":[42,201],"important":[43],"problem":[44],"mining":[47],"analysis":[49],"graphs.":[51,69],"In":[52],"this":[53,144],"article,":[54],"we":[55,168],"present":[56,148],"two":[57],"efficient":[58,77],"MPI-based":[59],"distributed":[60],"memory":[61],"parallel":[62,86,197],"algorithms":[63,172],"for":[64],"counting":[65],"big":[68],"The":[70,88,116],"first":[71],"algorithm":[72,89,118,159,190,199],"employs":[73],"overlapping":[74],"partitioning":[75],"load":[78],"balancing":[79],"schemes":[80],"provide":[82],"very":[84],"fast":[85],"algorithm.":[87,129,145,166],"scales":[90],"well":[91],"networks":[93,137],"with":[94,109,143],"can":[99,173,191],"compute":[100,184],"exact":[102],"network":[108,121],"10":[110],"billion":[111],"16":[114],"minutes.":[115],"second":[117],"divides":[119],"into":[122],"non-overlapping":[123],"partitions":[124],"leading":[125,157],"space-efficient":[128],"Our":[130,189],"results":[131],"on":[132],"both":[133,161],"artificial":[134],"real-world":[136],"demonstrate":[138,169],"space":[141],"saving":[142],"We":[146],"also":[147,192],"novel":[150],"approach":[151],"that":[152],"reduces":[153],"communication":[154],"cost":[155],"drastically":[156],"space-":[163],"runtime-efficient":[165],"Further,":[167],"how":[170],"our":[171],"be":[174,193],"used":[175],"list":[177],"all":[178],"clustering":[185],"coefficients":[186],"nodes.":[188],"adapted":[194],"approximation":[198],"using":[200],"edge":[202],"sparsification":[203],"method.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}