A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks
type: Item
instance of: scholarly article
title: A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks
zbMATH Open document ID: 1152.05052
author: Ali Peiravi
author: Hossein Tolooei Kheibari
published in: Applied Mathematics and Computation
publication date: 2008-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5342824
zbMATH Keywords: connectivity graph approximation
zbMATH Keywords: ad hoc networks
zbMATH Keywords: modified Manhattan measure
zbMATH Keywords: Monte Carlo simulation
zbMATH Keywords: mean degree distribution
MaRDI profile type: Publication
full work available at URL: j.amc.2007.12.026
OpenAlex ID: W2086458152
cites work: Connectivity graphs as models of local interactions
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
DOI: 10.1016/J.AMC.2007.12.026
Recommended article: Near-optimal fully-dynamic graph connectivity
Recommended article: Faster Deterministic Fully-Dynamic Graph Connectivity
Recommended article: Approximating a minimum Manhattan network
Recommended article: Faster Approximation of Distances in Graphs
Recommended article: A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
Recommended article: A topological approach to dynamic graph connectivity
Recommended article: Approximating minimum Manhattan networks in higher dimensions
description: scientific article; zbMATH DE number 5342824