Home /Research /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

Year
2007
Citations
12

Keywords

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

Related papers

Browse all OTHER papers