15 citations · 52 across the 7 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DM2009★ 8 cited
On uniform sampling simple directed graph realizations of degree sequences
M. Drew Lamar
Choosing a uniformly sampled simple directed graph realization of a degree sequence has many applications, in particular in social networks where self-loops are commonly not allowe…
math.CO2009★ 9 cited
Algorithms for realizing degree sequences of directed graphs
M. Drew LaMar
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extend…