| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Manoj, Changat |
|
| dc.contributor.author |
Henry, Martyn Mulder |
|
| dc.date.accessioned |
2014-07-22T08:56:15Z |
|
| dc.date.available |
2014-07-22T08:56:15Z |
|
| dc.date.issued |
2007-10-01 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4218 |
|
| dc.description |
Report/Econometric Institute, Erasmus University Rotterdam,EI 2007-34 |
en_US |
| dc.description.abstract |
Following the Majority Strategy in graphs, other consensus strategies, namely
Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on
graphs are discussed as methods for the computation of median sets of pro¯les. A
review of algorithms for median computation on median graphs is discussed and
their time complexities are compared. Implementation of the consensus strategies
on median computation in arbitrary graphs is discussed |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Econometric Institute Research Papers |
en_US |
| dc.subject |
Consensus Strategy |
en_US |
| dc.subject |
Majority Strategy |
en_US |
| dc.subject |
Plurality Strategy |
en_US |
| dc.subject |
Hill Climbing |
en_US |
| dc.subject |
Median computation |
en_US |
| dc.title |
Median computation in graphs using consensus strategies |
en_US |
| dc.type |
Article |
en_US |