Open AccessTight bounds for rumor spreading in graphs of a given conductance
Author(s) -
George Giakkoupis
Publication year - 2011
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - rumor , conductance , upper and lower bounds , graph , combinatorics , mathematics , discrete mathematics , computer science , public relations , political science , mathematical analysis