1 citations · 1 across the 5 of their papers we have counts for
6 papers
Continuous Fairness On Data Streams
Subhodeep Ghosh, Zhihui Du, Angela Bonifati +3
We study the problem of enforcing continuous group fairness over windows in data streams. We propose a novel fairness model that ensures group fairness at a finer granularity level…
Designing Parallel Algorithms for Community Detection using Arachne
Fuhuan Li, Zhihui Du, David A. Bader
The rise of graph data in various fields calls for efficient and scalable community detection algorithms. In this paper, we present parallel implementations of two widely used algo…
Cover Edge-Based Novel Triangle Counting
David A. Bader, Fuhuan Li, Zhihui Du +8
Listing and counting triangles in graphs is a key algorithmic kernel for network analyses, including community detection, clustering coefficients, k-trusses, and triangle centralit…
Contour Algorithm for Connectivity
Zhihui Du, Oliver Alvarado Rodriguez, Fuhuan Li +2
Finding connected components in a graph is a fundamental problem in graph analysis. In this work, we present a novel minimum-mapping based Contour algorithm to efficiently solve th…
Fast Triangle Counting
David A. Bader
Listing and counting triangles in graphs is a key algorithmic kernel for network analyses including community detection, clustering coefficients, k-trusses, and triangle centrality…
LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms
Gábor Szárnyas, David A. Bader, Timothy A. Davis +4
Graph algorithms can be expressed in terms of linear algebra. GraphBLAS is a library of low-level building blocks for such algorithms that targets algorithm developers. LAGraph bui…