1 citations · 1 across the 5 of their papers we have counts for
7 papers
On the Optimization of Methods for Establishing Well-Connected Communities
Mohammad Dindoost, Oliver Alvarado Rodriguez, Bartosz Bryg +4
Community detection plays a central role in uncovering meso scale structures in networks. However, existing methods often suffer from disconnected or weakly connected clusters, und…
HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
Mohammad Dindoost, Oliver Alvarado Rodriguez, Bartosz Bryg +2
Subgraph isomorphism, essential for pattern detection in large-scale graphs, faces scalability challenges in attribute-rich property graphs used in neuroscience, systems biology, a…
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…
Property Graphs in Arachne
Oliver Alvarado Rodriguez, Fernando Vera Buschmann, Zhihui Du +1
Analyzing large-scale graphs poses challenges due to their increasing size and the demand for interactive and user-friendly analytics tools. These graphs arise from various domains…
Community Detection in Hypergraphs via Mutual Information Maximization
Jurgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez +7
The hypergraph community detection problem seeks to identify groups of related nodes in hypergraph data. We propose an information-theoretic hypergraph community detection algorith…