39 citations · 42 across the 2 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2009★ 3 cited
Treewidth of Erdös-Rényi Random Graphs, Random Intersection Graphs, and Scale-Free Random Graphs
Yong Gao
We prove that the treewidth of an Erdös-Rényi random graph $\rg{n, m}$ is, with high probability, greater than for some constant if the edge/vertex ratio …
cs.DM2008★ 39 cited
The Degree Distribution of Random k-Trees
Yong Gao
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model…