Polynomial-time algorithms for minimum-time broadcast in trees

DOI10.1007/s00224-002-1047-5zbMath1012.68221OpenAlexW1977640803MaRDI QIDQ1871774

Margarida Mitjana, Johanne Cohen, Pierre Fraigniaud

Publication date: 4 May 2003

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-002-1047-5

zbMATH Keywords

merging method

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

A note on line broadcast in digraphs under the edge-disjoint paths mode

This page was built for publication: Polynomial-time algorithms for minimum-time broadcast in trees