---
res:
  bibo_abstract:
  - "The online semi-random graph process is a one-player game which starts with the
    empty graph on n vertices. At every round, a player (called Builder) is presented
    with a vertex v chosen uniformly at random and independently from previous rounds,
    and constructs an edge of their choice that is incident to v. Inspired by recent
    advances on the semi-random graph process, we define a family of generalized online
    semi-random models.\r\nWe analyse a particular instance that shares similar features
    with the original semi-random graph process and determine the hitting times of
    the classical graph properties minimum degree k,k-connectivity, containment of
    a perfect matching, a Hamiltonian cycle and an \r\nH-factor for a fixed graph
    H possessing an additional tree-like property. Along the way, we derive a few
    consequences of the famous Aldous-Broder algorithm that may be of independent
    interest.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Sofiya
      foaf_name: Burova, Sofiya
      foaf_surname: Burova
  - foaf_Person:
      foaf_givenName: Lyuben
      foaf_name: Lichev, Lyuben
      foaf_surname: Lichev
      foaf_workInfoHomepage: http://www.librecat.org/personId=9aa8388e-d003-11ee-8458-c4c1d7447977
  bibo_doi: 10.1016/j.ejc.2025.104120
  bibo_volume: 126
  dct_date: 2025^xs_gYear
  dct_identifier:
  - UT:001420659400001
  dct_isPartOf:
  - http://id.crossref.org/issn/0195-6698
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: The semi-random tree process@
...