A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

DOI10.1016/j.disc.2007.07.105zbMath1155.05059OpenAlexW2070543274MaRDI QIDQ932651

Daming Zhu, Hengwu Li, Shaohan Ma, Guohui Yao

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.105

zbMATH Keywords

algorithmdirected acyclic graphspanning treeminimum time broadcast

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Communication, information (94A99) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the complexity of the shortest-path broadcast problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods and problems of communication in usual networks
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
• Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• A matter of degree
• A survey of gossiping and broadcasting in communication networks
• Minimum-time line broadcast networks
• Topological design of centralized computer networks—formulations and algorithms
• Fast Gossiping by Short Messages
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Approximation algorithms for finding low-degree subgraphs
• Approximation Algorithms for Minimum-Time Broadcast
• Many birds with one stone

This page was built for publication: A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem