Strong geodetic problem in networks : computational complexity and solution for Apollonian networks

@inproceedings{Manuel2016StrongGP,
  title={Strong geodetic problem in networks : computational complexity and solution for Apollonian networks},
  author={Paul Christopher Manuel and Sandi Klavzar and A. Jasmine Xavier and Andrew Arokiaraj and Elizabeth Thomas},
  year={2016}
}
The geodetic problem was introduced by Harary et al. [17]. 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.