|
Dyuthi @ CUSAT >
e-SCHOLARSHIP >
Computer Applications >
Faculty >
Dr. Kannan Balakrishnan >
Please use this identifier to cite or link to this item:
http://purl.org/purl/4208
|
| Title: | The Plurality Strategy on Graphs |
| Authors: | Kannan, Balakrishnan
Manoj, Changat
Henry, Martyn Mulder |
| Keywords: | Plurality Strategy
median
consensus function
median graph
majority rule |
| Issue Date: | 15-Sep-2006 |
| Publisher: | Econometric Institute Research Papers |
| Abstract: | The Majority Strategy for finding medians of a set of clients on a graph
can be relaxed in the following way: if we are at v, then we move to a neighbor
w if there are at least as many clients closer to w than to v (thus ignoring the
clients at equal distance from v and w). The graphs on which this Plurality
Strategy always finds the set of all medians are precisely those for which the
set of medians induces always a connected subgraph |
| Description: | Report/Econometric Institute, Erasmus University Rotterdam |
| URI: | http://dyuthi.cusat.ac.in/purl/4208 |
| Appears in Collections: | Dr. Kannan Balakrishnan
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
