DSpace About DSpace Software

Dyuthi @ CUSAT >
Computer Applications >
Faculty >
Dr. Kannan Balakrishnan >

Please use this identifier to cite or link to this item: http://purl.org/purl/4217

Title: On the generalized obnoxious center problem: antimedian subsets
Authors: Kannan, Balakrishnan
Bostjan, Brešar
Manoj, Changat
Sandi, Klavzar
Matjaz, Kovse
Ajitha, Subhamathi R
Keywords: graph distance
antimedian set
computational complexity
linear programming
Issue Date: 14-Feb-2008
Abstract: The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered.
URI: http://dyuthi.cusat.ac.in/purl/4217
Appears in Collections:Dr. Kannan Balakrishnan

Files in This Item:

File Description SizeFormat
On the generalized obnoxious center problemantimedian subsets.pdfpdf139.09 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback