Now showing items 1-1 of 1

    • k-Connectedness and k-Factors in the Semi-Random Graph Process 

      Koerts, Hidde (University of Waterloo, 2022-12-20)
      The semi-random graph process is a single-player graph game where the player is initially presented an edgeless graph with n vertices. In each round, the player is offered a vertex u uniformly at random and subsequently ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages