Median computation in graphs using consensus strategies

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.

MoreLess

Year of publication:	2007-10-01
Authors:	Balakrishnan, K. ; Changat, M. ; Mulder, H.M.
Institutions:	Erasmus University Rotterdam, Econometric Institute
Subject:	consensus strategy \| majority strategy \| Hill climbing median computation

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Econometric Institute Report. - ISSN 1566-7294.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series RePEc:dgr:eureir Number EI 2007-34
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005450875