|
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/4218
|
| Title: | Median computation in graphs using consensus strategies |
| Authors: | Kannan, Balakrishnan
Manoj, Changat
Henry, Martyn Mulder |
| Keywords: | Consensus Strategy
Majority Strategy
Plurality Strategy
Hill Climbing
Median computation |
| Issue Date: | 1-Oct-2007 |
| Publisher: | Econometric Institute Research Papers |
| 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 |
| Description: | Report/Econometric Institute, Erasmus University Rotterdam,EI 2007-34 |
| URI: | http://dyuthi.cusat.ac.in/purl/4218 |
| Appears in Collections: | Dr. Kannan Balakrishnan
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
