24 citations · 56 across the 21 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2019★ 3 cited
A GraphBLAS Approach for Subgraph Counting
Langshi Chen, Jiayu Li, Ariful Azad +7
Subgraph counting aims to count the occurrences of a subgraph template T in a given network G. The basic problem of computing structural properties such as counting triangles and o…
cs.DC2018
High-Performance Massive Subgraph Counting using Pipelined Adaptive-Group Communication
Langshi Chen, Bo Peng, Sabra Ossen +4
Subgraph counting aims to count the number of occurrences of a subgraph T (aka as a template) in a given graph G. The basic problem has found applications in diverse domains. The p…
cs.DC2012★ 4 cited
Efficient Algorithms for Maximum Link Scheduling in Distributed Computing Models with SINR Constraints
Guanhong Pei, Anil Kumar S. Vullikanti
A fundamental problem in wireless networks is the maximum link scheduling problem: given a set of links, compute the largest possible subset of links that can b…