Median computation in graphs using consensus strategies
October 2007
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ei2007-34.pdf, 0.2MB) |
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.
Keywords
Automatically Extracted Terms
- graph
- strategy
- profile
- vertex
- ascent hill
- vertice
- majority strategy
- majority
- algorithm
- plurality strategy
- plurality
- ascent
- split
- graph g
- time complexity
- | uv |
- complexity
- theorem
- expansion
- condorcet
