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 2 of 2 for “"semi-random graph process"”.
-
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 …
-
Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes
… variant of the problem, the vertices of the graph are revealed and processed by the algorithm sequentially. We introduce a new linear program to design and analyze combinatorial algorithms which work in greater generality than that of previous works, and which also yield the best-known …