Blar i Department of Informatics på emneord "parameterized complexity"
Viser treff 1-1 av 1
-
A faster algorithm for computing c-closure
(Master thesis, 2023-06-13)Exploiting the structure of graphs is a well-known strategy for solving hard problems on complex graphs. In our studies we consider structural characteristics of social network graphs, in particular ways to exploit the ...