Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, March 19, 2019, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Ahad N. Zehmakan

Consider a graph G and an initial coloring, where each node is black or white. In each round, all nodes simultaneously update their color based on a predefined rule. In a threshold model, a node becomes black if a certain fraction/number of its neighbors are black, and white otherwise. We say a node set D is a dynamo whenever the following holds: If D is fully black initially, the whole graph becomes black eventually. In this talk, we prove tight upper and lower bounds on the minimum size of a dynamo. Moreover, some hardness results regarding the problem of determining the minimum size of a dynamo for a given graph G are presented.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login