3 citations · 7 across the 6 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
Reversible Random Walks on Dynamic Graphs
Nobutaka Shimizu, Takeharu Shiraga
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap b…
cs.DM2016★ 3 cited
Average Shortest Path Length of Graphs of Diameter 3
Nobutaka Shimizu, Ryuhei Mori
A network topology with low average shortest path length (ASPL) provides efficient data transmission while the number of nodes and the number of links incident to each node are oft…