Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-24T18:00:08.486Z Has data issue: false hasContentIssue false
  • English
  • Français

Randomized Algorithms for Determining the Majority on Graphs

Published online by Cambridge University Press:  14 August 2006

GIANLUCA DE MARCO  and
ANDRZEJ PELC
GIANLUCA DE MARCO
Affiliation:
Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, via Moruzzi 1, 56124 Pisa, Italy (e-mail: gianluca.demarco@iit.cnr.it)
ANDRZEJ PELC
Affiliation:
Département d'informatique, Université du Québec en Outaouais, Gatineau, Québec J8X 3X7, Canada (e-mail: andrzej.pelc@uqo.ca)
Get access Rights & Permissions [Opens in a new window]

Abstract

Every node of an undirected connected graph is coloured white or black. Adjacent nodes can be compared and the outcome of each comparison is either 0 (same colour) or 1 (different colours). The aim is to discover a node of the majority colour, or to conclude that there is the same number of black and white nodes. We consider randomized algorithms for this task and establish upper and lower bounds on their expected running time. Our main contribution are lower bounds showing that some simple and natural algorithms for this problem cannot be improved in general.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 15 , Issue 6 , November 2006 , pp. 823 - 834
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)