首页 /研究 /A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks
OTHER

A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks

Ali Peiravi, Hossein Tolooei Kheibari

发表年份
2007
引用次数
12

关键词

Computer scienceRange (aeronautics)Algebraic connectivityRandom graphGraphAlgorithmMonte Carlo methodDegree distributionWireless ad hoc networkDegree (music)

相关论文

查看 OTHER 分类全部论文