Engineering a Distributed-Memory Triangle Counting Algorithm
Work
Year: 2023
Type: article
Abstract: Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs using massively para... more
Authors Peter Sanders, Tim Niklas Uhl
Institution Karlsruhe Institute of Technology
Cites: 44
Cited by: 2
Related to: 10
FWCI: 0.452
Citation percentile (by year/subfield): 80.86
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder European Research Council