Linear Algebra Approach for Directed Triad Counting and Enumeration

Triangle counting and enumeration are commonly used in real-world applications on directed graphs. However, the performance of triangle counting algorithms is usually bench-marked on undirected graphs. As such, many of these algorithms and formulations are not suitable for identifying the types of d...

Full description

Saved in:
Bibliographic Details
Published in:SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis pp. 718 - 726
Main Authors: Kerdcharoen, Yuttapichai, Sridhar, Upasana, Sangpetch, Orathai, Low, Tze Meng
Format: Conference Proceeding
Language:English
Published: IEEE 17.11.2024
Subjects:
Conferences
Directed graphs
Fires
graph algorithms
High performance computing
Linear algebra
Object recognition
Optimization
Single instruction multiple data
Systematics
triad census
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Triangle counting and enumeration are commonly used in real-world applications on directed graphs. However, the performance of triangle counting algorithms is usually bench-marked on undirected graphs. As such, many of these algorithms and formulations are not suitable for identifying the types of directed triangles in directed graphs. In this work, we show how algorithms for counting each type of directed triad (directed triangle) can be formulated using linear algebra. Leveraging the FLAME methodology, we show that provably correct counting and enumeration algorithms for directed triads can be derived from the linear algebraic formulation. These algorithms can be used to count individual triads or together to count all possible triads. We show that despite being designed for individual use, the combined use of these algorithms yields a geometric mean speedup of 92.69x and 2.86x over the implementations in NetworkX and GraphBLAS (SuiteSparse 7.6), respectively, on various workloads from real-world directed graphs.
AbstractList Triangle counting and enumeration are commonly used in real-world applications on directed graphs. However, the performance of triangle counting algorithms is usually bench-marked on undirected graphs. As such, many of these algorithms and formulations are not suitable for identifying the types of directed triangles in directed graphs. In this work, we show how algorithms for counting each type of directed triad (directed triangle) can be formulated using linear algebra. Leveraging the FLAME methodology, we show that provably correct counting and enumeration algorithms for directed triads can be derived from the linear algebraic formulation. These algorithms can be used to count individual triads or together to count all possible triads. We show that despite being designed for individual use, the combined use of these algorithms yields a geometric mean speedup of 92.69x and 2.86x over the implementations in NetworkX and GraphBLAS (SuiteSparse 7.6), respectively, on various workloads from real-world directed graphs.
Author Kerdcharoen, Yuttapichai
Sangpetch, Orathai
Low, Tze Meng
Sridhar, Upasana
Author_xml – sequence: 1
  givenname: Yuttapichai
  surname: Kerdcharoen
  fullname: Kerdcharoen, Yuttapichai
  email: ykerdcha@andrew.cmu.edu
  organization: Carnegie Mellon University,Department of Electrical and Computer Engineering,Pittsburgh,PA,USA
– sequence: 2
  givenname: Upasana
  surname: Sridhar
  fullname: Sridhar, Upasana
  email: upasanas@cmu.edu
  organization: Carnegie Mellon University,Department of Electrical and Computer Engineering,Pittsburgh,PA,USA
– sequence: 3
  givenname: Orathai
  surname: Sangpetch
  fullname: Sangpetch, Orathai
  email: orathai@cmkl.ac.th
  organization: CMKL University,Department of Electrical and Computer Engineering,Bangkok,Thailand
– sequence: 4
  givenname: Tze Meng
  surname: Low
  fullname: Low, Tze Meng
  email: lowt@cmu.edu
  organization: Carnegie Mellon University,Department of Electrical and Computer Engineering,Pittsburgh,PA,USA
BookMark eNotzLtOwzAUAFAjgQSUfAEM_oGE62fiMQrlIUVioIixunGui6XWiZx04O8ZYDrbuWWXaUrE2L2ASghwjx_dl1VSQyVB6gpAAFywwtWuUQaUMUara1YsSxzAgmk0NOaGdX1MhJm3xwMNGXk7z3lC_83DlPlTzORXGvkuRxx5N53TGtOBYxr5Np1PlHGNU7pjVwGPCxX_btjn83bXvZb9-8tb1_YlSmPX0uvRW6tHWRuUjkjqEMgqLR06M5AJvkEhpVAo_RiI6kE56wahDArtA6gNe_h7IxHt5xxPmH_2AhoJtdPqF-JQS8g
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SCW63240.2024.00100
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350355543
EndPage 726
ExternalDocumentID 10820794
Genre orig-research
GroupedDBID 6IE
6IL
ACM
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIL
ID FETCH-LOGICAL-a256t-c4dc664d275a29ee24ffe63429a95be5fc8a12213a2cdfee7b3969b135a14cf03
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001451792300078&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 01:59:34 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a256t-c4dc664d275a29ee24ffe63429a95be5fc8a12213a2cdfee7b3969b135a14cf03
PageCount 9
ParticipantIDs ieee_primary_10820794
PublicationCentury 2000
PublicationDate 2024-Nov.-17
PublicationDateYYYYMMDD 2024-11-17
PublicationDate_xml – month: 11
  year: 2024
  text: 2024-Nov.-17
  day: 17
PublicationDecade 2020
PublicationTitle SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis
PublicationTitleAbbrev SC-W
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib060584085
Score 1.889525
Snippet Triangle counting and enumeration are commonly used in real-world applications on directed graphs. However, the performance of triangle counting algorithms is...
SourceID ieee
SourceType Publisher
StartPage 718
SubjectTerms Conferences
Directed graphs
Fires
graph algorithms
High performance computing
Linear algebra
Object recognition
Optimization
Single instruction multiple data
Systematics
triad census
Title Linear Algebra Approach for Directed Triad Counting and Enumeration
URI https://ieeexplore.ieee.org/document/10820794
WOSCitedRecordID wos001451792300078&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoxcAEiCDe8sAaiB-J47GKWjFVlSiiW-XHBSGhFJWW389dkgILA5vlxbLv7Lvz3fcdY7eFgtKHXKchC0WK8Re-g1GrNG-dj6hz6btmE2Y6LRcLO-vB6i0WBgDa4jO4o2Gby4-rsKWvMrzhaK9QgQZsYIzpwFo75aH0HrF19cxCIrP3j9UzkZFnGAVK4sgWBGP71UOlNSGTw38ufsSSHzAen32bmWO2B80JqzCGRB3lo7cXyvzyUU8NztEH5d0zBpHPUbsir_p2ENw1kY8bAly24kjY02Q8rx7Svh9C6tAx2aRBx1AUOkqTO2kBpK5rKBRaFGdzD1SN5YSUQjkZYg1gvLKF9ULlTuhQZ-qUDZtVA2eMawwTiGvPeB-0BVM6GbPSG4feY22DOGcJncDyvaO8WO42f_HH_CU7oEMmkJ4wV2y4WW_hmu2Hz83rx_qmFdQXMWWTQg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aBT2pWPFtDl5XN6_N5liWloq1FKzYW8ljVgTZSt36-02yW_XiwVvIJSQzycxk5vsGoeuMQW6s4IlNbZb4-Mu_g46zRETnw3FBTdNsQo7H-WymJi1YPWJhACAWn8FNGMZcvlvYVfgq8zfc2yuvQJtoS3BOSQPXWqtPSPAFvq6WW4ik6vaxeA505KmPA2lgySYByPari0o0IoO9fy6_j7o_cDw8-TY0B2gDqkNU-CjSaynuvb2E3C_uteTg2HuhuHnIwOGp1y-Hi7YhBNaVw_0qQC6jQLroadCfFsOk7YiQaO-a1InlzmYZd1QKTRUA5WUJGfM2RSthINRjaUIpYZpaVwJIw1SmDGFCE27LlB2hTrWo4Bhh7gOFwLYnjbFcgcw1dWlupPb-Y6ksOUHdcALz94b0Yr7e_Okf81doZzh9GM1Hd-P7M7QbDjxA9og8R516uYILtG0_69eP5WUU2hcMQJaJ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=SC24-W%3A+Workshops+of+the+International+Conference+for+High+Performance+Computing%2C+Networking%2C+Storage+and+Analysis&rft.atitle=Linear+Algebra+Approach+for+Directed+Triad+Counting+and+Enumeration&rft.au=Kerdcharoen%2C+Yuttapichai&rft.au=Sridhar%2C+Upasana&rft.au=Sangpetch%2C+Orathai&rft.au=Low%2C+Tze+Meng&rft.date=2024-11-17&rft.pub=IEEE&rft.spage=718&rft.epage=726&rft_id=info:doi/10.1109%2FSCW63240.2024.00100&rft.externalDocID=10820794