| Title: | On the generalized obnoxious center problem: antimedian subsets |
| Author: | Kannan, Balakrishnan; Bostjan, Brešar; Manoj, Changat; Sandi, Klavzar; Matjaz, Kovse; Ajitha, Subhamathi R |
| 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 |
| Date: | 2008-02-14 |
| Files | Size | Format | View | Description |
|---|---|---|---|---|
| On the generali ... blemantimedian subsets.pdf | 139.0Kb |
View/ |