Median computation in graphs using consensus strategies
Kannan Balakrishnan, Manoj Changat, Henry Martyn Mulder · RePub (Erasmus University Rotterdam) · 2007
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.