Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers

Luca Cappelletti, Tommaso Fontana, Oded Green, David Bader

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Triangles and squares count are widely-used graph analytic metrics providing insights into the connectivity of a graph. While the literature has focused on algorithms for global counts in simple graphs, this paper presents parallel algorithms for global and per-node triangle and square counts in large multigraphs. The algorithms have linear improvements in computational complexity as the number of cores increases. The triangle count algorithm has the same complexity as the best-known algorithm in the literature. The squares count algorithm has a lower execution time than previous methods. The proposed algorithms are evaluated on six real-world graphs and multigraphs, including protein-protein interaction graphs, knowledge graphs and large web graphs.

Original languageEnglish (US)
Title of host publicationComputational Science – ICCS 2023 - 23rd International Conference, Proceedings
EditorsJiří Mikyška, Clélia de Mulatier, Valeria V. Krzhizhanovskaya, Peter M. A. Sloot, Maciej Paszynski, Jack J. Dongarra
PublisherSpringer Science and Business Media Deutschland GmbH
Pages635-646
Number of pages12
ISBN (Print)9783031360268
DOIs
StatePublished - 2023
Event23rd International Conference on Computational Science, ICCS 2023 - Prague, Czech Republic
Duration: Jul 3 2023Jul 5 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14076 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Conference on Computational Science, ICCS 2023
Country/TerritoryCzech Republic
CityPrague
Period7/3/237/5/23

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Keywords

  • Count
  • Graph
  • Multigraph
  • Squares
  • Triangles

Fingerprint

Dive into the research topics of 'Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers'. Together they form a unique fingerprint.

Cite this