Erciyes, Kayhan2024-07-122024-07-122021978-1-6654-0759-510.1109/IISEC54230.2021.96723902-s2.0-85125352202https://doi.org/10.1109/IISEC54230.2021.9672390https://hdl.handle.net/20.500.12415/73812nd International Informatics and Software Engineering Conference (IISEC) - Artificial Intelligence for Digital Transformation -- DEC 16-17, 2021 -- Ankara, TURKEYWe review main graph clustering algorithms which are MST-based, Shared Nearest Neighbor and Edge-Betweenness algorithms and show novel algebraic graph implementations using Python. We compare them using randomly generated scale-free graphs and provide pointers for parallel processingeninfo:eu-repo/semantics/closedAccessGraph ClusteringMst-Based ClusteringShared Nearest Neighbor ClusteringEdge-Betweenness ClusteringConference ObjectN/AWOS:000841548300026N/A