Performance Evaluation of Core Maximization Algorithms in Graphs

The purpose of the thesis was to study core maximization algorithms in graphs. We examined the fundamental theorems that govern our problem as well as the existing algorithms in the literature that address it. Furthermore, we selected specific algorithms which we implemented in a programming environment and performed experiments to determine their effectiveness. We formulated our own theorem for one of the algorithms we examined, and we also dealt with a different variation of these problems and propose a first algorithm in pseudocode form for its solution.