scientific article; zbMATH DE number 1875435

zbMath1006.68959MaRDI QIDQ4796194

Pierre Fraigniaud

Publication date: 2 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610440

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

gossipingapproximation algorithmsmulticastingbroadcastingminimum degree spanning treegraph and network algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (6)

On the number of broadcast schemes in networks ⋮ On the complexity of the shortest-path broadcast problem ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ A note on line broadcast in digraphs under the edge-disjoint paths mode ⋮ Sublogarithmic approximation for telephone multicast ⋮ Minimal path broadcast networks

This page was built for publication: