Random Graphs and Algorithms.pdf (1.08 MB)
0/0

Random Graphs and Algorithms

Download (1.08 MB)
thesis
posted on 01.01.2017 by Tony Johansson

This thesis is concerned with the study of random graphs and random algorithms. There are three overarching themes. One theme is sparse random graphs, i.e. random graphs in which the average degree is bounded with high probability. A second theme is that of finding spanning subsets such as spanning trees, perfect matchings and Hamilton cycles. A third theme is solving optimization problems on graphs with random edge costs.

History

Date

01/01/2017

Degree Type

Dissertation

Department

Mathematical Sciences

Degree Name

Doctor of Philosophy (PhD)

Advisor(s)

Alan Frieze

Exports

Exports