Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2005 (2005), Issue 9, Pages 1405-1413
http://dx.doi.org/10.1155/IJMMS.2005.1405

An efficient g-centroid location algorithm for cographs

Department of Computer Science and Computer Engineering, La Trobe University Bundoora, Melbourne 3086, VIC, Australia

Received 19 August 2004; Revised 17 January 2005

Copyright © 2005 V. Prakash. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [2 citations]

The following is the list of published articles that have cited the current article.

  • Prakash Veeraraghavan, “An efficient g-centroid location algorithm for ptolemaic graphs,” Proceedings - International Symposium on Computer Science and Its Applications, CSA 2008, pp. 309–313, 2008. View at Publisher · View at Google Scholar
  • Tinaz Ekim, and Aysel Erey, “Block decomposition approach to compute a minimum geodetic,” RAIRO - Operations Research, vol. 48, no. 4, pp. 497–507, 2014. View at Publisher · View at Google Scholar