Convexities, Centroids in Graphs and their Application in Mobile Ad hoc Networks

DOI10.32381/JCISS.2019.44.1-4.3zbMath1529.05144MaRDI QIDQ6181580

Prakash Veeraraghavan

Publication date: 3 January 2024

Published in: Journal of Combinatorics, Information & System Sciences (Search for Journal in Brave)

zbMATH Keywords

NP-hardness\(g\)-convexity\(g\)-centroid

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

This page was built for publication: Convexities, Centroids in Graphs and their Application in Mobile Ad hoc Networks