Strong geodetic problem in networks: computational complexity and solution for Apollonian networks
Combinatorics
2017-08-15 v1
Abstract
The geodetic problem was introduced by Harary et al. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic problem. The problem is solved for complete Apollonian networks. It is also proved that in general the strong geodetic problem is NP-complete.
Cite
@article{arxiv.1708.03868,
title = {Strong geodetic problem in networks: computational complexity and solution for Apollonian networks},
author = {Paul Manuel and Sandi Klavžar and Antony Xavier and Andrew Arokiaraj and Elizabeth Thomas},
journal= {arXiv preprint arXiv:1708.03868},
year = {2017}
}