arXiv CS
open access
Enumeration-based Triangle Counting on GPUs
Subgraph enumeration in partitioned graphs across distributed-memory systems is beset with challenges in balancing data movement with the local computation. Especially, counting the number of triangles induced by the closed wedges (i.e., length-3 cycles) is a measure of connectedness in a graph, but
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Enumeration-based Triangle Counting on GPUs#1414668
- GRBench: A Comprehensive Benchmark Evaluation for Graph-relational Data Management#622635
- Smallest Cubic Non-1-Planar Graphs#1063379
- A Complexity Dichotomy for Edge Subdivision to $H$-Free Graphs#1387039
- FusionRCG: Orchestrating Recursive Computation Graphs across GPU Memory Hierarchies#175203
Record · ID 1406421
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive