Application of G-Convexity in mobile ad hoc networks.
Conference Paper
Overview
Research
Identity
Additional Document Info
View All
Overview
abstract
In this paper we present a new application of the classical g-convexity defined for graphs in Mobile ad hoc networks (MANET). We also establish that g-centroid location for an arbitrary connected graph is NP-hard.
