Notes on Growing a Tree in a Graph

Luc Devroye,Vida Dujmović,Alan Frieze,Abbas Mehrabian,Pat Morin,Bruce Reed

RANDOM STRUCTURES & ALGORITHMS（2017）

引用 1|浏览101

暂无评分

摘要

We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.

查看译文

关键词

cheeger constant,first-passage percolation,graph degeneracy,graph genus,planar graphs,random spanning tree,treewidth

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要