An efficient g-centroid location algorithm for cographs. (12th July 2005)
- Record Type:
- Journal Article
- Title:
- An efficient g-centroid location algorithm for cographs. (12th July 2005)
- Main Title:
- An efficient g-centroid location algorithm for cographs
- Authors:
- Prakash, V.
- Abstract:
- Abstract : In 1998, Pandu Rangan et al. Proved that locating theg -centroid for an arbitrary graph isπ© π« -hard by reducing the problem of finding the maximum clique size of a graph to theg -centroid location problem. They have also given an efficient polynomial time algorithm for locating theg -centroid for maximal outerplanar graphs, Ptolemaic graphs, and split graphs. In this paper, we present anO ( n m ) time algorithm for locating theg -centroid for cographs, wheren is the number of vertices andm is the number of edges of the graph.
- Is Part Of:
- International journal of mathematics and mathematical sciences. Number 9(2005)
- Journal:
- International journal of mathematics and mathematical sciences
- Issue:
- Number 9(2005)
- Issue Display:
- Volume 9, Issue 9 (2005)
- Year:
- 2005
- Volume:
- 9
- Issue:
- 9
- Issue Sort Value:
- 2005-0009-0009-0000
- Page Start:
- 1405
- Page End:
- 1413
- Publication Date:
- 2005-07-12
- Subjects:
- Mathematics -- Periodicals
510.5 - Journal URLs:
- https://www.hindawi.com/journals/ijmms/ β
- DOI:
- 10.1155/IJMMS.2005.1405 β
- Languages:
- English
- ISSNs:
- 0161-1712
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) β
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 10472.xml