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

DOI10.1016/j.amc.2007.12.026zbMath1152.05052OpenAlexW2086458152MaRDI QIDQ945254

Hossein Tolooei Kheibari, Ali Peiravi

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.12.026

zbMATH Keywords

Monte Carlo simulationad hoc networksconnectivity graph approximationmean degree distributionmodified Manhattan measure

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (2)

A connectivity graph generation approach for Manhattan path calculation in detailed facility layout ⋮ Optimal locating by integrating volumetric fuzzy sets and geographic coordinate system: an application to healthcare

Cites Work

• Connectivity graphs as models of local interactions
• Coordination of groups of mobile autonomous agents using nearest neighbor rules

This page was built for publication: A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks