parallel-programming

Repo to store projects of parallel programming.

Includes three implementation of the Rich Club Coefficient in Graphs, one Serial implementation and two Parallel implementations exploring parrallel programming in C++.

---

Theme: Rich Club Coefficient in Graphs

Wikipedia Definition:¹

The rich-club coefficient is a metric on graphs and networks, designed to measure the extent to which well-connected nodes also connect to each other. Networks which have a relatively high rich-club coefficient are said to demonstrate the rich-club effect and will have many connections between nodes of high degree. The rich-club coefficient was first introduced in 2004 in a paper studying Internet topology.²³

The "Rich-club" effect has been measured and noted on scientific collaboration networks and air transportation networks. It has been shown to be significantly lacking on protein interaction networks.

Footnotes

1. Wikipedia contributors. (2023, March 14). Rich-club coefficient. In Wikipedia, The Free Encyclopedia. Retrieved 11:53, April 14, 2023, from https://en.wikipedia.org/w/index.php?title=Rich-club_coefficient&oldid=1144638929 ↩

2. Zhou, Shi & Mondragón, Raúl J. (2004). "The Rich-Club Phenomenon In The Internet Topology". IEEE Communications Letters. 8 (3): 180–182. arXiv:cs/0308036. doi:10.1109/lcomm.2004.823426. S2CID 7007263. ↩

3. Mattia Gasparini, Javier Luis Canovas Izquierdo, Robert Clariso, Marco Brambilla, Jordi Cabot: Analyzing Rich-Club Behavior in Open Source Projects. OpenSym 2019 proceedings ↩