Title of article
The complexity of broadcasting in planar and decomposable graphs Original Research Article
Author/Authors
Andreas Jakoby، نويسنده , , Rudiger Reischuk، نويسنده , , Christian Schindelhauer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
28
From page
179
To page
206
Abstract
Broadcasting in processor networks means disseminating a single piece of information, which is originally known only at some nodes, to all members of the network. The goal is to inform everybody using as few rounds as possible, that is minimize the broadcast time.
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884730
Link To Document