This is a simple school assignment. I just have to implement an algorithm to calculate betweenness centrality.
-
Updated
Oct 16, 2017 - C++
This is a simple school assignment. I just have to implement an algorithm to calculate betweenness centrality.
Develop a parallel algorithm to measure the betweenness of centrality. It provides a 4.6% better result than the conventional algorithm.
Code for the paper "Bavarian: Betweenness Centrality Approximation with Variance-Aware Rademacher Averages", by Chloe Wohlgemuth, Cyrus Cousins, and Matteo Riondato, appearing in ACM KDD'21 and ACM TKDD'23
Research project that focuses on observing the Resilience of Delhi Road Networks to Traffic Disruptions
Given an instance of set of nodes in a social network graph, the aim is to find the influencing important users and to predict the likelihood of a future association between two nodes, knowing that there is no association between the nodes in the current state of the graph.
Energy Grid Optimization and Analysis (EGOA)
ABCDE: Approximating Betweenness-Centrality ranking with progressive-DropEdge
Using Gephi, we analyzed Deezer's social interactions to uncover user patterns and communities. This helps tailor offerings, focus on gender-specific groups, and identify key influencers, providing strategic insights for Deezer's marketing.
Girvan Newman algorithm time complexity improvement
Basic Matlab scripts for social network analysis.
Analysis of European Union Mail dataset to compute degree centrality, betweenness, interaction and visualization using the R-shiny app.
Graph Processing Framework that supports || OpenMP || CAPI
Python based projects done as part of core courses at IIITD
Find pivot universities in collaboration network
This project utilizes various metrics to analyze a graph network based on data of ENZYMES_g295
Learning From Networks (LFN) project repository. "Learning From Networks" is a course of the master degree in "Computer Engineering" at the University of Padua, Italy.
A tool for browse and analyze Docker Registries
MINF(Most Important Node Finder) is used to find the top k nodes that are part of most of the data transfer in an undirected un-weighted graphs using the concept of betweenness centrality.
Theorie des graphes - tous les algorithmes pratiques. Graph Theory - All practical Algorithms
Add a description, image, and links to the betweenness-centrality topic page so that developers can more easily learn about it.
To associate your repository with the betweenness-centrality topic, visit your repo's landing page and select "manage topics."