244 citations · 319 across the 3 of their papers we have counts for
1 paper · 1 filter
Y. S. Cho, J. S. Lee, H. J. Herrmann +1
Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of g fraction of t…