An Efficient g-Centroid Location Algorithm for Ptolemaic Graphs

In an earlier paper by C.Pandu et al (1998), we presented an O(m 2 ) algorithm for locating the g-centroid for ptolemaic graphs. Here we improve the time complexity and propose an efficient O(n 3 )-time algorithm for locating the g-centroid for ptolemaic graphs. This is by defining an auxiliary grap...

Full description

Saved in:
Bibliographic Details
Published inInternational Symposium on Computer Science and its Applications pp. 309 - 313
Main Author Veeraraghavan, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2008
Subjects
Classification algorithms
Complexity theory
Computer science
Distance measurement
Distributed computing
g-centroid
g-convexity
Mobile ad hoc networks
Polynomials
ptolemaic graphs
Online AccessGet full text
ISBN0769534287
9780769534282
ISSN2159-7030
DOI10.1109/CSA.2008.49

Cover

More Information
Summary:In an earlier paper by C.Pandu et al (1998), we presented an O(m 2 ) algorithm for locating the g-centroid for ptolemaic graphs. Here we improve the time complexity and propose an efficient O(n 3 )-time algorithm for locating the g-centroid for ptolemaic graphs. This is by defining an auxiliary graph.
ISBN:0769534287
9780769534282
ISSN:2159-7030
DOI:10.1109/CSA.2008.49