8 citations · 8 across the 1 of their papers we have counts for
1 paper
Dana Turlykozhayeva, Sayat Akhtanov, Nurzhan Ussipov +3
A routing algorithm is the most fundamental problem in complex network communication. In complex networks, the amount of computation increases as the number of nodes increases whic…