Veeraraghavan Prakash

Learn More
In 1998, Pandu Rangan et al. proved that locating the g-centroid for an arbitrary graph is ᏺᏼ-hard by reducing the problem of finding the maximum clique size of a graph to the g-centroid location problem. They have also given an efficient polynomial time algorithm for locating the g-centroid for maximal outerplanar graphs, Ptolemaic graphs, and split(More)
  • 1