Now showing items 1-3 of 3

    • Algorithms for sampling spanning trees uniformly at random 

      Costantini, Lucia (Universitat Politècnica de Catalunya, 2020-07)
      Master thesis
      Open Access
      Thesis on the analysis of various algorithms for sampling spanning trees of a graph uniformly at random.
    • Approximation schemes for randomly sampling colorings 

      González I Sentís, Marta (Universitat Politècnica de Catalunya, 2019-10)
      Master thesis
      Open Access
      Graph colouring is arguably one of the most important issues in Graph Theory. However, many of the questions that arise in the area such as the chromatic number problem or counting the number of proper colorings of a graph ...
    • Discrete duality principle in different random graph models 

      Lesgourgues, Thomas (Universitat Politècnica de Catalunya, 2019-07)
      Master thesis
      Open Access
      For a given random graph, a connected component that contains a finite fraction of the entire graph's vertices is called giant. The study of these components started with the \ER model, where it has been proven that removing ...