Distributed and non-distributed algorithms for generating random graphs that are scale-free and have the small-world property
Student Name
Aya Kahine
Thesis Type
Master Thesis
Thesis Status
Finished
Academic Year
2017 - 2018
Degree
Master in Applied Science and Engineering: Computer Science
Promoter
Jan Hidders
Supervisor(s)
Download
Description
The thesis addresses the problem of efficiently generating graphs that have the two properties that are typical for real-world graphs: scale-freeness and the small-world property. The challenge is to achieve both properties, although it is in fact already difficult to obtain one of them without generating additional artificial patterns in the graphs. Both sequential and distributed algorithms will be considered.