Median computation in graphs using consensus strategies

Dyuthi/Manakin Repository

Median computation in graphs using consensus strategies

Show full item record

Title: Median computation in graphs using consensus strategies
Author: Kannan, Balakrishnan; Manoj, Changat; Henry, Martyn Mulder
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
Date: 2007-10-01


Files in this item

Files Size Format View Description
Median computat ... g consensus strategies.pdf 190.8Kb PDF View/Open pdf

This item appears in the following Collection(s)

Show full item record

Search Dyuthi


Advanced Search

Browse

My Account