Scalable distributed Louvain algorithm for community detection in large graphs
NS Sattar, S Arifuzzaman - The Journal of Supercomputing, 2022 - Springer
Community detection (or clustering) in large-scale graphs is an important problem in graph
mining. Communities reveal interesting organizational and functional characteristics of a …
mining. Communities reveal interesting organizational and functional characteristics of a …
Fast parallel algorithms for counting and listing triangles in big graphs
Big graphs (networks) arising in numerous application areas pose significant challengesfor
graph analysts as these graphs grow to billions of nodes and edges and are prohibitively …
graph analysts as these graphs grow to billions of nodes and edges and are prohibitively …
A dataset for software requirements risk prediction
The risk prediction in the software development is mandatory for it to be recognized,
categorized and prioritized earlier for the success of the project. The requirement gathering …
categorized and prioritized earlier for the success of the project. The requirement gathering …
Engineering a distributed-memory triangle counting algorithm
Counting triangles in a graph and incident to each vertex is a fundamental and frequently
considered task of graph analysis. We consider how to efficiently do this for huge graphs …
considered task of graph analysis. We consider how to efficiently do this for huge graphs …
A comparative analysis of large-scale network visualization tools
MAM Faysal, S Arifuzzaman - 2018 IEEE International …, 2018 - ieeexplore.ieee.org
Network (Graph) is a powerful abstraction for representing underlying relations and
structures in large complex systems. Network visualization provides a convenient way to …
structures in large complex systems. Network visualization provides a convenient way to …
A fast parallel algorithm for counting triangles in graphs using dynamic load balancing
S Arifuzzaman, M Khan… - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
Finding the number of triangles in a graph (network) is an important problem in graph
analysis. The number of triangles also has important applications in graph mining. Big …
analysis. The number of triangles also has important applications in graph mining. Big …
Parallelizing louvain algorithm: Distributed memory challenges
NS Sattar, S Arifuzzaman - 2018 IEEE 16th Intl Conf on …, 2018 - ieeexplore.ieee.org
Louvain algorithm is a well-known and efficient method for detecting communities or clusters
in social and information networks (graphs). The emergence of large network data …
in social and information networks (graphs). The emergence of large network data …
Balanced parallel triangle enumeration with an adaptive algorithm
Triangle enumeration is a foundation brick for solving harder graph problems related to
social networks, the Internet and transportation, to name a few applications. This problem is …
social networks, the Internet and transportation, to name a few applications. This problem is …
Overcoming mpi communication overhead for distributed community detection
NS Sattar, S Arifuzzaman - … : Second Workshop, SCEC 2018, Delhi, India …, 2019 - Springer
Community detection is an important graph (network) analysis kernel used for discovering
functional units and organization of a graph. Louvain method is an efficient algorithm for …
functional units and organization of a graph. Louvain method is an efficient algorithm for …
LiteTE: Lightweight, communication-efficient distributed-memory triangle enumerating
Distributed-memory triangle enumerating has attracted considerable interests due to its
potential capability to process huge graphs quickly. However, existing algorithms suffer from …
potential capability to process huge graphs quickly. However, existing algorithms suffer from …