114 citations · 138 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.SI2019★ 15 cited
Measuring Directed Triadic Closure with Closure Coefficients
Hao Yin, Austin R. Benson, Johan Ugander
Recent work studying triadic closure in undirected graphs has drawn attention to the distinction between measures that focus on the "center" node of a wedge (i.e., length-2 path) v…
cs.DM2019
On the distance and algorithms of strong product digraphs
Haoran Yin, Feng Li
Strong product is an efficient way to construct a larger digraph through some specific small digraphs. The large digraph constructed by the strong product method contains the facto…