| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Bostjan, Brešar |
|
| dc.contributor.author |
Manoj, Changat |
|
| dc.contributor.author |
Sandi, Klavzar |
|
| dc.contributor.author |
Matjaz, Kovse |
|
| dc.contributor.author |
Ajitha, Subhamathi R |
|
| dc.date.accessioned |
2014-07-22T08:50:15Z |
|
| dc.date.available |
2014-07-22T08:50:15Z |
|
| dc.date.issued |
2008-02-14 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4217 |
|
| dc.description.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. |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology |
en_US |
| dc.language.iso |
en |
en_US |
| dc.subject |
graph distance |
en_US |
| dc.subject |
remoteness |
en_US |
| dc.subject |
antimedian set |
en_US |
| dc.subject |
computational complexity |
en_US |
| dc.subject |
linear programming |
en_US |
| dc.title |
On the generalized obnoxious center problem: antimedian subsets |
en_US |
| dc.type |
Article |
en_US |