Template-Type: ReDIF-Paper 1.0
Author-Name: Balakrishnan, K.
Author-Name-Last: Balakrishnan
Author-Name-First: Kannan
Author-Name: Changat, M.
Author-Name-Last: Changat
Author-Name-First: Manoj
Author-Name: Mulder, H.M.
Author-Name-Last: Mulder
Author-Name-First: Martyn
Title: Median computation in graphs using consensus strategies
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 profiles. 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.
Creation-Date: 2007-10-01
File-URL: https://repub.eur.nl/pub/10556/ei2007-34.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2007-34
Keywords: Hill climbing median computation, consensus strategy, majority strategy
Handle: RePEc:ems:eureir:10556