孤僻
发表于 2025-3-25 05:54:22
7楼
KIN
发表于 2025-3-25 08:39:52
7楼
prodrome
发表于 2025-3-25 12:01:28
7楼
熄灭
发表于 2025-3-25 15:54:59
7楼
freight
发表于 2025-3-25 23:15:04
8楼
遵循的规范
发表于 2025-3-26 03:15:38
8楼
delta-waves
发表于 2025-3-26 04:37:52
8楼
Inertia
发表于 2025-3-26 10:07:35
8楼
阴郁
发表于 2025-3-26 15:52:21
“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Settinged for sparse graphs. In graphs of maximum degree Δ, we can test for arbitrary subgraphs of diameter . in . rounds. For triangles, we devise an algorithm featuring a round complexity of ., where . denotes the arboricity of ..
Monolithic
发表于 2025-3-26 19:18:40
http://reply.papertrans.cn/35/3482/348164/348164_30.png