Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"post-positional semi-random graph process"”.

  1. k-Connectedness and k-Factors in the Semi-Random Graph Process

    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 chooses a second vertex v deterministically ac- cording to some strategy, and …

    waterloo Repository record for k-Connectedness and k-Factors in the Semi-Random Graph Process (opens in a new tab)