Paper Info
Title
Distributed CONGESTBC constant approximation of MDS in bounded genus graphs.
Abstract
We give a distributed algorithm which finds a constant approximation of a minimum dominating set in graphs of constant genus. The algorithm works in the CONGESTBC model (distributed, synchronous, with short messages and broadcast type of transmissions) and runs in a constant number of distributed rounds.
Year
DOI
Venue
2019
10.1016/j.tcs.2018.07.008
Theoretical Computer Science
Keywords
Field
DocType
Distributed algorithms,Minimum dominating set,Bounded genus graphs,Local algorithms
Broadcasting,Graph,Discrete mathematics,Combinatorics,Distributed algorithm,Minimum dominating set,Mathematics,Bounded function
Journal
Volume
ISSN
Citations 
757
0304-3975
0
PageRank 
References 
Authors
0.34
9
4
Name
Order
Citations
PageRank
Andrzej Czygrinow122725.81
Michal Hanćkowiak2816.66
Wojciech Wawrzyniak3978.23
Marcin Witkowski484.79