12 citations · 27 across the 15 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
The stripping process can be slow: part II
Pu Gao
This paper is a continuation of the previous results on the stripping number of a random uniform hypergraph, and the maximum depth over all non-k-core vertices. The previous result…
math.CO2015★ 6 cited
The stripping process can be slow: part I
Pu Gao, Mike Molloy
Given an integer k, we consider the parallel k-stripping process applied to a hypergraph H: removing all vertices with degree less than k in each iteration until reaching the k-cor…